Abstract
This paper presents an efficient approach to represent the environment, which can be used to facilitate dynamic path planning in robot navigation systems. The environment is modelled by first defining a 'virtual rectangle' to represent an environment that avoids unwanted obstacles. The obstacles within the environment are then represented as convex polygons to generate the required visibility graph. The devised techniques lend well for hardware porting and thus highly suited to high-speed generation of the visibility graph. It has been demonstrated that efficient dynamic path planning can be realised by generating the 'virtual rectangle' on the fly such that only the environment needed to facilitate onward traversal can be identified. Finally, the proposed algorithms lend well for high-speed computations as they facilitate a high-degree of parallelism at the architecture level.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aki, S. A. and Lyons, K. A.: Parallel Computational Geometry, Prentice-Hall, Englewood Cliffs, 1993.
Fu, L.-C. and Liu, D.-Y.: An efficient algorithm for finding a collision-free path among polyhedral obstacles, J. Robotic Systems 7(1) (1990), 129-137.
Fujimura, K.: Motion planning amidst dynamic obstacles on three dimensions, in: Proc. of the IEEE/RSJ Internat. Conf. on Intelligent Robots and Systems, July 1993, pp. 1387-1392.
Goodrich, M. T., Shauck, S. B., and Guha, S.: Parallel methods for visibility and shortest path problems in simple polygons, in: Proc. of the Sixth Annual Symposium on Computational Geometry, 1990, pp. 73-82.
Graham, J. H.: Computer Architectures for Robotics and Automation, Gordon and Breach, London, 1987.
Janet, J. A., Luo, R. C., and Kay, M. G.: T-vectors make autonomous mobile robot motion planning and self-referencing more efficient, in: IEEE Internat. Conf. on Intelligent Robots and Systems, 1994, pp. 587-594.
Kortenkamp, D., Bonasso, R. P., and Murphy, R.: Artificial Intelligence and Mobile Robots, AAAI Press/MIT Press, 1998.
Kutulakos, K. N., Lumelsky, V. J., and Dyer, C. R.: Vision guided exploration: A step toward general motion planning in three dimensions, in: IEEE Internat. Conf. on Robotics and Automation, 1993, pp. 289-296.
Lam, S. K.: VLSI based high-speed routing strategy for network management, Honours Year Report, School of Applied Science, Nanyang Technological University, Singapore, 1998.
Lin, M. C. and Canny, J. F.: A fast algorithm for incremental distance calculation, in: Proc. of IEEE Internat. Conf. on Robotics and Automation, April 1991, pp. 1008-1014.
Liu, Y.-H. and Arimoto, S.: Proposal of tangent graph and extended tangent graph for path planning of mobile robots, in: Proc. IEEE Internat. Conf. on Robotics and Automation, April 1991, pp. 312-317.
Lozano-Perez, T.: Spatial planning: A configuration space approach, IEEE Trans. Computers (February 1983), 108-120.
Luo, R. C. and Pan, T.-J.: An intelligent path planning system for robot navigation in an unknown environment, in: SPIE Mobile Robots IV, Vol. 1195, 1989, pp. 316-326.
Quek, K. H. and Srikanthan, T.: A hierarchical representation of roadway networks, in: 7th World Congress on Intelligent Transport Systems, Italy, November 2000.
Rao, T. M. and Arkin, R. C.: 3D path planning for flying/crawling robots, in: SPIE Mobile Robots IV, Vol. 1195, 1989, pp. 88-96.
Sharir, M.: On shortest paths amidst convex polyhedra, SIAM J. Comput. 16(3) (June 1987), 561-572.
Sharir, M. and Schorr, A.: On shortest paths in polyhedral spaces, SIAM J. Comput. 15(1) (1986), 193-215.
Shu, C. and Buxton, H.: A parallel path planning algorithm for mobile robots, in: Proc. of the 1st Internat. Conf. on Automation, Robotics and Computer Vision, 1990, pp. 489-493.
Shu, C. and Buxton, H.: Dynamic motion planning using a distributed representation, J. Intelligent Robotic Systems (November 1995), 241-262.
Stentz, A.: Optimal and efficient path planning for unknown and dynamic environments, Internat. J. Robotics Automat. 10 (1995), 89-100.
Stifter, S.: A medley of solutions to the robot collision problem in two and three dimensions, Johannes Kepler Universität Linz, 1989.
Tzionas, P., Tsalides, Ph., and Thanailakis, A.: 3-D minimum cost path planning using cellular automata architectures, in: SPIE Mobile Robots VII, Vol. 1831, 1992, pp. 297-306.
Tzionas, P., Tsalides, Ph., and Thanailakis, A.: Collision-free path planning for a diamond-shaped robot using two-dimensional cellular automata, IEEE Trans. Robotics Automat. 13(2) (1997), 237-250.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lam, S.K., Srikanthan, T. High-Speed Environment Representation Scheme for Dynamic Path Planning. Journal of Intelligent and Robotic Systems 32, 307–319 (2001). https://doi.org/10.1023/A:1013949515552
Issue Date:
DOI: https://doi.org/10.1023/A:1013949515552