暂无分享,去创建一个
[1] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[2] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[3] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[4] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[5] Rodney A. Brooks,et al. A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[6] Otto Nurmi,et al. Algorithms for computational geometry , 1987 .
[7] John Canny,et al. The complexity of robot motion planning , 1988 .
[8] Kenneth L. Clarkson,et al. A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..
[9] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[10] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.
[11] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[12] Yoram Koren,et al. Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[13] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[14] Lydia E. Kavraki,et al. Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[15] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[16] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.
[17] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[18] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[19] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[20] Lydia E. Kavraki,et al. Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..
[21] Steven M. LaValle,et al. Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[22] Jean-Claude Latombe,et al. Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..
[23] Lydia E. Kavraki,et al. Computational Approaches to Drug Design , 1999, Algorithmica.
[24] Steven M. LaValle,et al. RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[25] Neil C. Rowe,et al. Finding Optimal-Path Maps for Path Planning across Weighted Regions , 2000, Int. J. Robotics Res..
[26] Joshua A. Levine,et al. Sampling-based planning, control and verification of hybrid systems , 2000 .
[27] Stephan Merz,et al. Model Checking , 2000 .
[28] E. Feron,et al. Real-time motion planning for agile autonomous vehicles , 2000, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).
[29] Luc Devroye,et al. Analysis of range search for random k-d trees , 2001, Acta Informatica.
[30] Shuzhi Sam Ge,et al. Dynamic Motion Planning for Mobile Robots Using Potential Field Method , 2002, Auton. Robots.
[31] J. Dall,et al. Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[32] Steven M. LaValle,et al. Efficient nearest neighbor searching for motion planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[33] Manuela M. Veloso,et al. Real-time randomized path planning for robot navigation , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.
[34] Jean-Claude Latombe,et al. Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..
[35] Masayuki Inaba,et al. Dynamically-Stable Motion Planning for Humanoid Robots , 2002, Auton. Robots.
[36] Steven M. LaValle,et al. On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..
[37] Steven M. LaValle,et al. Current Issues in Sampling-Based Motion Planning , 2005, ISRR.
[38] Reid G. Simmons,et al. Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).
[39] Michael M. Curtiss,et al. RRTs for nonlinear, discrete, and hybrid planning and control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[40] Sebastian Thrun,et al. ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.
[41] Norman I. Badler,et al. Real-time reach planning for animated characters using hardware acceleration , 2003, Proceedings 11th IEEE International Workshop on Program Comprehension.
[42] Lydia E. Kavraki,et al. Measure theoretic analysis of probabilistic path planning , 2004, IEEE Transactions on Robotics and Automation.
[43] Emilio Frazzoli,et al. Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems , 2004, HSCC.
[44] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[45] S. Muthukrishnan,et al. The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.
[46] Hanan Samet,et al. Applications of spatial data structures - computer graphics, image processing, and GIS , 1990 .
[47] Sunil Arya,et al. Space-time tradeoffs for approximate spherical range counting , 2005, SODA '05.
[48] Ali Esmaili,et al. Probability and Random Processes , 2005, Technometrics.
[49] Anthony Stentz,et al. Anytime RRTs , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[50] Steven M. LaValle,et al. Planning algorithms , 2006 .
[51] Lydia E. Kavraki,et al. Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning , 2006, WAFR.
[52] Tamim Asfour,et al. Manipulation Planning Among Movable Obstacles , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.
[53] M. Branicky,et al. On Heavy-tailed Runtimes and Restarts in Rapidly-exploring Random Trees , 2008 .
[54] Dmitry Berenson,et al. An optimization approach to planning for mobile manipulation , 2008, 2008 IEEE International Conference on Robotics and Automation.
[55] Sebastian Thrun,et al. Anytime search in dynamic graphs , 2008, Artif. Intell..
[56] Sebastian Thrun,et al. Path Planning for Autonomous Driving in Unknown Environments , 2008, ISER.
[57] Maxim Likhachev,et al. Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles , 2008, Int. J. Robotics Res..
[58] Steven M. LaValle,et al. Motion Planning for Highly Constrained Spaces , 2009 .
[59] S. LaValle,et al. Space-Filling Trees , 2009 .
[60] Emilio Frazzoli,et al. Sampling-based motion planning with deterministic μ-calculus specifications , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.
[61] N. Roy,et al. The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance , 2009, Int. J. Robotics Res..
[62] Jonathan P. How,et al. Real-Time Motion Planning With Applications to Autonomous Urban Driving , 2009, IEEE Transactions on Control Systems Technology.
[63] Ian R. Manchester,et al. LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification , 2010, Int. J. Robotics Res..
[64] Tara N. Sainath,et al. A voice-commandable robotic forklift working alongside humans in minimally-prepared outdoor environments , 2010, 2010 IEEE International Conference on Robotics and Automation.
[65] Gökhan Inalhan,et al. Integration of Path/Maneuver Planning in Complex Environments for Agile Maneuvering UCAVs , 2010, J. Intell. Robotic Syst..
[66] Emilio Frazzoli,et al. Bounds on tracking error using closed-loop rapidly-exploring random trees , 2010, Proceedings of the 2010 American Control Conference.
[67] Emilio Frazzoli,et al. Optimal kinodynamic motion planning using incremental sampling-based methods , 2010, 49th IEEE Conference on Decision and Control (CDC).
[68] Ian R. Manchester,et al. Bounding on rough terrain with the LittleDog robot , 2011, Int. J. Robotics Res..
[69] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..
[70] Herbert A. David,et al. Order Statistics , 2011, International Encyclopedia of Statistical Science.