Toward a String-Pulling Approach to Path Smoothing on Grid Graphs
作者： Tansel Uras , Sven Koenig , Jihee Han
DOI:
关键词:
摘要:
nsf.gov参考文章(11)
Neil Burch, Robert C. Holte, Jonathan Schaeffer, Peter Yap, Any-angle path planning for computer games national conference on artificial intelligence. pp. 201- 207 ,(2011)
Ian Millington, John Funge, Artificial Intelligence for Games CRC Press. ,(2009) , 10.1201/9781315375229
Michal Pěchouček, David Šišlák, Přemysl Volf, Accelerated A* path planning adaptive agents and multi agents systems. pp. 1133- 1134 ,(2009)
Ariel Felner, Kenny Daniel, Sven Koenig, Alex Nash, Theta*: any-angle path planning on grids Journal of Artificial Intelligence Research. ,vol. 39, pp. 533- 579 ,(2010) , 10.1613/JAIR.2994
Dave Ferguson, Anthony Stentz, Using interpolation to improve path planning: The Field D* algorithm Journal of Field Robotics. ,vol. 23, pp. 79- 101 ,(2006) , 10.1002/ROB.20109
C. Thorpe, L. Matthies, Path Relaxation: Path Planning for a Mobile Robot OCEANS 1984. pp. 576- 581 ,(1984) , 10.1109/OCEANS.1984.1152243
Daniel Harabor, Alban Grastien, An optimal any-angle pathfinding algorithm international conference on automated planning and scheduling. pp. 308- 311 ,(2013)
Sunglok Choi, Jae-Yeong Lee, Wonpil Yu, Fast any-angle path planning on grid maps with non-collision pruning 2010 IEEE International Conference on Robotics and Biomimetics. pp. 1051- 1056 ,(2010) , 10.1109/ROBIO.2010.5723473
Alex Nash, Sven Koenig, Any-angle path planning Ai Magazine. ,vol. 34, pp. 85- 107 ,(2012) , 10.1609/AIMAG.V34I4.2512
J. E. Bresenham, Algorithm for computer control of a digital plotter Ibm Systems Journal. ,vol. 4, pp. 25- 30 ,(1965) , 10.1147/SJ.41.0025