Any-Angle Path Planning
暂无分享,去创建一个
[1] Charles E. Thorpe,et al. Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.
[2] Anthony Stentz,et al. Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[3] Sunglok Choi,et al. Any-angle path planning on non-uniform costmaps , 2011, 2011 IEEE International Conference on Robotics and Automation.
[4] Sven Koenig,et al. Incremental A* , 2001, NIPS.
[5] Jonathan Schaeffer,et al. Comparison of Different Grid Abstractions for Pathfinding on Maps , 2003, IJCAI.
[6] Maxim Likhachev,et al. D*lite , 2002, AAAI/IAAI.
[7] Ian Millington,et al. Artificial Intelligence for Games , 2006, The Morgan Kaufmann series in interactive 3D technology.
[8] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[9] Mark. Deloura,et al. Game Programming Gems , 2000 .
[10] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[11] Steven M. LaValle,et al. Planning algorithms , 2006 .
[12] Der-Tsai Lee. Proximity and reachability in the plane. , 1978 .
[13] Joseph S. B. Mitchell,et al. New results on shortest paths in three dimensions , 2004, SCG '04.
[14] Wolfram Burgard,et al. Autonomous driving in a multi-level parking structure , 2009, 2009 IEEE International Conference on Robotics and Automation.
[15] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[16] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[17] Anthony Stentz,et al. 3D Field D: Improved Path Planning and Replanning in Three Dimensions , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[18] Julie D Thompson,et al. Multiple Sequence Alignment Using ClustalW and ClustalX , 2003, Current protocols in bioinformatics.
[19] Roland Siegwart,et al. An Interpolated Dynamic Navigation Function , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[20] Leo Dorst,et al. Differential A* , 2002, IEEE Trans. Knowl. Data Eng..
[21] Hanan Samet,et al. An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures , 1988 .
[22] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[23] Maxim Likhachev,et al. Planning for Manipulation with Adaptive Motion Primitives , 2011, 2011 IEEE International Conference on Robotics and Automation.
[24] David Furcy,et al. Incremental Heuristic Search in Artificial Intelligence , 2004 .
[25] Jack Bresenham,et al. Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..
[26] Lydia E. Kavraki,et al. Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[27] Steven M. LaValle,et al. On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..
[28] Lukás Chrpa. Trajectory Planning on Grids: Considering Speed Limit Constraints , 2011, SCAI.
[29] Anthony Stentz,et al. Planning with Uncertainty in Position Using High-Resolution Maps , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.
[30] Mark H. Overmars,et al. New methods for computing visibility graphs , 1988, SCG '88.
[31] Jonathan Schaeffer,et al. Dynamic Control in Real-Time Heuristic Search , 2008, J. Artif. Intell. Res..
[32] Sven Koenig,et al. Speeding up moving-target search , 2007, AAMAS '07.
[33] Jonathan Schaeffer,et al. Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning , 2011, AAAI.
[34] Ron Kimmel,et al. Optimal Algorithm for Shape from Shading and Path Planning , 2001, Journal of Mathematical Imaging and Vision.
[35] Bernard Chazelle,et al. Decomposing a polygon into its convex parts , 1979, STOC.
[36] Joseph S. B. Mitchell,et al. Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.
[37] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[38] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..
[39] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[40] Pierre Bessière,et al. The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..
[41] Gabriel Hugh Elkaim,et al. Curvature-continuous trajectory generation with corridor constraint for autonomous ground vehicles , 2010, 49th IEEE Conference on Decision and Control (CDC).
[42] Subhash Suri,et al. Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[43] Joseph S. B. Mitchell,et al. Shortest paths among obstacles in the plane , 1993, SCG '93.
[44] Howie Choset,et al. Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .
[45] Peter Yap,et al. Grid-Based Path-Finding , 2002, Canadian Conference on AI.
[46] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..
[47] Ira Pohl,et al. The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.
[48] Sven Koenig,et al. Fast replanning for navigation in unknown terrain , 2005, IEEE Transactions on Robotics.
[49] Sebastian Thrun,et al. Autonomous driving in semi-structured environments: Mapping and planning , 2009, 2009 IEEE International Conference on Robotics and Automation.
[50] M. Lings,et al. Articles , 1967, Soil Science Society of America Journal.
[51] Rajeev Motwani,et al. Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..
[52] Anthony Stentz,et al. Using interpolation to improve path planning: The Field D* algorithm , 2006, J. Field Robotics.
[53] C. Bajaj. The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .
[54] Michel Pocchiola,et al. Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.
[55] Mark Berman,et al. Field D* path-finding on weighted triangulated and tetrahedral meshes , 2012, Autonomous Agents and Multi-Agent Systems.
[56] M. Egerstedt,et al. Graph-based path planning for mobile robots , 2006 .
[57] Enrique Alvarez Fanjul,et al. Path planning for gliders using Regional Ocean Models: Application of Pinzón path planner with the ESEOAT model and the RU27 trans-Atlantic flight data , 2010, OCEANS'10 IEEE SYDNEY.
[58] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[59] 김곤우,et al. Any-angle Path Planning 기반의 안전경로계획 , 2014 .
[60] Ross A. Knepper,et al. Constrained Optimization Path Following of Wheeled Robots in Natural Terrain , 2006, ISER.
[61] David M. Mount,et al. An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.
[62] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[63] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[64] John Canny,et al. The complexity of robot motion planning , 1988 .
[65] S. Arimoto,et al. Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles , 1992 .
[66] Leonidas J. Guibas,et al. Visibility of disjoint polygons , 2005, Algorithmica.
[67] Martial Hebert,et al. Experiments with driving modes for urban robots , 1999, Optics East.
[68] J A Sethian,et al. A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[69] Sebastian Thrun,et al. Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments , 2010, Int. J. Robotics Res..
[70] Nathan R. Sturtevant,et al. Speeding Up Learning in Real-time Search via Automatic State Abstraction , 2005, AAAI.
[71] Chandrajit L. Bajaj,et al. The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..
[72] Michel Pocchiola,et al. Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..
[73] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[74] Sebastian Thrun,et al. Anytime search in dynamic graphs , 2008, Artif. Intell..
[75] Steven M. LaValle,et al. Steps toward derandomizing RRTs , 2004, Proceedings of the Fourth International Workshop on Robot Motion and Control (IEEE Cat. No.04EX891).
[76] Benedek Nagy,et al. Shortest Paths in Triangular Grids with Neighbourhood Sequences , 2003 .
[77] Kurt Konolige,et al. A gradient method for realtime robot control , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).
[78] Sven Koenig,et al. Incremental Phi*: Incremental Any-Angle Path Planning on Grids , 2009, IJCAI.
[79] Steven M. LaValle,et al. Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .
[80] Adi Botea,et al. Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..
[81] M. Pechoucek,et al. Accelerated A * Trajectory Planning : Grid-based Path Planning Comparison , 2009 .
[82] Alonzo Kelly,et al. Trajectory Generation on Rough Terrain Considering Actuator Dynamics , 2005, FSR.
[83] Roland Siegwart,et al. Path Planning, Replanning, and Execution for Autonomous Driving in Urban and Offroad Environments , 2007 .
[84] Alban Grastien,et al. An Optimal Any-Angle Pathfinding Algorithm , 2013, ICAPS.
[85] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[86] Roland Siegwart,et al. Smooth path planning in constrained environments , 2009, ICRA 2009.
[87] Sven Koenig,et al. Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D , 2010, SOCS.
[88] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[89] Steve Rabin,et al. AI Game Programming Wisdom , 2002 .
[90] Paul Pao-Yen Wu,et al. On-board multi-objective mission planning for Unmanned Aerial Vehicles , 2009, 2009 IEEE Aerospace conference.
[91] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[92] C. B. Crous. Autonomous robot path planning , 2009 .
[93] Bruce Randall Donald,et al. Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.
[94] Martial Hebert,et al. A complete navigation system for goal acquisition in unknown environments , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.
[95] David Furcy,et al. Incremental Heuristic Search in AI , 2004, AI Mag..
[96] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[97] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[98] Robin R. Murphy,et al. Introduction to AI Robotics , 2000 .
[99] Alberto Lacaze,et al. Path planning for robotic vehicles using generalized Field D* , 2008, SPIE Defense + Commercial Sensing.
[100] Sven Koenig,et al. A Project on Any-Angle Path Planning for Computer Games for “ Introduction to Artificial Intelligence ” Classes , 2010 .
[101] Sebastian Thrun,et al. Single agent and multi-agent path planning in unknown and dynamic environments , 2006 .
[102] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[103] Joseph S. B. Mitchell,et al. The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.
[104] David Sislák,et al. Accelerated A* path planning , 2009, AAMAS.
[105] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[106] Sven Koenig,et al. Performance bounds for planning in unknown terrain , 2003, Artif. Intell..
[107] Jonathan Schaeffer,et al. Any-Angle Path Planning for Computer Games , 2011, AIIDE.
[108] Subhash Suri,et al. An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..
[109] Lukás Chrpa,et al. Smoothed Hex-grid Trajectory Planning using Helicopter Dynamics , 2011, ICAART.
[110] Sunglok Choi,et al. Fast any-angle path planning on grid maps with non-collision pruning , 2010, 2010 IEEE International Conference on Robotics and Biomimetics.
[111] Anthony Stentz,et al. R* Search , 2008, AAAI.
[112] Jean-Claude Latombe,et al. On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..
[113] Anthony Stentz,et al. Global planning on the Mars Exploration Rovers: Software integration and surface testing , 2009, J. Field Robotics.
[114] Ariel Felner,et al. Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.
[115] Éva Tardos,et al. Algorithm design , 2005 .
[116] Alexander A. Stepanov,et al. Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape , 1990, Autonomous Robot Vehicles.
[117] M. Carter. Computer graphics: Principles and practice , 1997 .