<--- Back to Details
First PageDocument Content
Search algorithms / Robot navigation / Motion planning / Theoretical computer science / Rapidly-exploring random tree / Needle / Linear programming / Nearest neighbor search
Date: 2009-10-26 01:51:32
Search algorithms
Robot navigation
Motion planning
Theoretical computer science
Rapidly-exploring random tree
Needle
Linear programming
Nearest neighbor search

Planning ”Fireworks” Trajectories for Steerable Medical Needles to Reduce Patient Trauma Jijie Xu1 , Vincent Duindam2 , Ron Alterovitz3 , Jean Pouliot4 , J. Adam M. Cunha4 , I-Chow Joe Hsu4 and Ken Goldberg2 Abstract

Add to Reading List

Source URL: goldberg.berkeley.edu

Download Document from Source Website

File Size: 345,77 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ †  David R. Cher

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document