Generic path planning for real-time applications

Proceedings of Computer Graphics International Conference, CGI

Volumn , Issue , 2004, Pages 299-306

  Niederberger, Christoph ^a   Radovic, Dejan ^a   Gross, Markus ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GENERIC; OPTIMAL ALGORITHMS; ROADMAPS;

ALGORITHMS; COMPUTER SIMULATION; GRAPHIC METHODS; NAVIGATION; PROBLEM SOLVING; REAL TIME SYSTEMS; VIRTUAL REALITY;

MOTION PLANNING;

EID: 5444274480     PISSN: 15301052     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGI.2004.1309225     Document Type: Conference Paper

References (17)

1. E. by Dante Treglia. Game Programming Gems 3. Charles River Media, Hingham, MA, 2002.
2. E. by Mark DeLoura. Game Programming Gems. Charles River Media, Hingham, MA, 2000.
3. E. by Mark DeLoura. Game Programming Gems 2. Charles River Media, Hingham, MA, 2001.
4. E. by Steve Rabin. AI Game Programming Wisdom. Charles River Media, Hingham, MA, 2002.
5. J. Canny. The Complexity of Robot Motion Planning. MIT Press, 1988.
6. I. L. Davis. "Warp speed: Path planning for star trek: Armada," In AAAI Spring Symposium Technical Report (2000 AAAI Spring Symposium), 2000.
7. T. Hu, A. Kahng, and G. Robins. "Optimal robust path planning in general environments." IEEE Transactions on Robotics and Automation, 9:775-784, 1993.
8. L. E. Kavraki, J.-C. Latombe, R. Motwani, and P. Raghavan. "Randomized query processing in robot path planning." In ACM Symposium on Theory of Computing, pages 353-362, 1995.
9. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars. "Probabilistic roadmaps for path planning in high dimensional configuration spaces." IEEE Transactions on Robotics and Automation, 12(4):566-580, 1996.
10. J. C. Latombe. Robot Motion Planning. MIT Press, 1969.
11. C. O'Dunlaing and C. Yap. "A retraction method for planning the motion of a disk." In J. Algorithms, pages 187-192, 1985.
12. J. O'Rourke. Computational geometry in C. Cambridge University Press, 1994.
13. J. T. Schwartz, M. Sharir, and J. E. Hopcroft. Planning, Geometry and Complexity of Robot Motion. Ablex Publishing Corp., 1987.
14. R. Seidel. "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons." Technical report, "Institute for Computer Science", Department of Mathematics, Freie Universität Berlin, 1990.
15. A. Stentz. "The focussed d* algorithm for real-time replanning." In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1652-1659, 1995.
16. P. Tozour and I. S. Austin. "Building a near-optimal navigation mesh." AI Game Programming Wisdom, pages 171-185, 2002.
17. T. Young. "Expanded geometry for points-of-visibility pathfinding." Game Programming Gems 2, pages 317-323, 2001.