Roadmap-Based Collision-Free Motion Planning for Multiple Moving Agents in a Smart Home Environment

  • Jae Byung Park
  • Beom Hee Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4541)


This paper proposes an approach to collision-free navigation for multiple moving agents in a smart home environment using the visibility map which is one of road maps. The visibility map plans collision-free paths of agents against stationary obstacles. The collision-free paths are represented by Hermite curves taking into consideration smoothness of the path and its first derivative. For collision-free motion planning among multiple moving agents, the collision map scheme proposed to effectively analyze collisions between two robots is employed. According to the result of the collision analysis, time scheduling is applied for realizing collision avoidance. Simulation results show the effectiveness and feasibility of the proposed approach in collision-free navigation of multiple moving agents.


Collision-free Motion Planning Multiple Agents  Visibility Map 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akella, A., Hutchinson, S.: Coordinating the motions of multiple robots with specified trajectories. In: IEEE International Conference on Robotics and Automation, pp. 624–631 (2002)Google Scholar
  2. 2.
    Lee, B.H., Lee, C.S.G.: Collision-free motion planning of two robots: IEEE Transactions on Systems, Man and Cybernetics, SMC-17(1) (1987)Google Scholar
  3. 3.
    Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM. 22(10), 560–570 (1979)CrossRefGoogle Scholar
  4. 4.
    Mahkovic, R., Slivnik, T.: Constructing the Generalized Local Voronoi Diagram from Laser Range Scanner Data. IEEE Transactions on Systems, Man, and Cybernetics-Part. A: Systems and Humans 30(6), 710–719 (2000)CrossRefGoogle Scholar
  5. 5.
    Meyer, W., Benedict, P.: Path planning and the geometry of joint space obstacles. In: IEEE International Conference on Robotics and Automation, pp. 215–219 (1988)Google Scholar
  6. 6.
    Khatib, O.: Real-Time obstacle avoidance for manipulators and mobile robots. Journal of Robotic Research 5(1), 90–98 (1986)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementations. The MIT Press, Cambridge (2005)zbMATHGoogle Scholar
  8. 8.
    Cormen, T., et al.: Introduction to Algorithms. The MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  9. 9.
    Fujimura, K.: Motion Planning in Dynamic Environment. In: Computer Science Workbench. LNCS, Springer, Heidelberg (1991)Google Scholar
  10. 10.
    Hopcroft, J.E., Schwartz, J.T., Sharir, M.: On the complexity of motion planning for multiple independent objects; PSPACE-Hardness of the Warehouseman’s Problem. Journal of Robotics Research 3(4), 76–88 (1984)CrossRefGoogle Scholar
  11. 11.
    Ji, S.H., Choi, J.S., Lee, B.H.: A Computational Interactive Approach to Multi-agent Motion Planning. International Journal of Control, Automation, and Systems (in press) (2007)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Jae Byung Park
    • 1
  • Beom Hee Lee
    • 1
  1. 1.School of Electrical Engineering and Computer Sciences, Seoul National University, SeoulKorea

Personalised recommendations