메뉴 건너뛰기




Volumn 38, Issue 3, 2008, Pages 884-893

Real-time robot path planning via a distance-propagating dynamic system with obstacle clearance

Author keywords

Dynamic environment; Dynamic programming (DP); Dynamic system; Mobile robot; Obstacle clearance; Path planning; Real time navigation; Safety margins

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; DYNAMICAL SYSTEMS; MOBILE ROBOTS; MOTION PLANNING; REAL TIME SYSTEMS;

EID: 44849128920     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.921002     Document Type: Article
Times cited : (65)

References (24)
  • 1
    • 33746833561 scopus 로고    scopus 로고
    • An efficient dynamic system for realtime robot-path planning
    • Aug
    • A. R. Willms and S. X. Yang, "An efficient dynamic system for realtime robot-path planning," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 4, pp. 755-766, Aug. 2006.
    • (2006) IEEE Trans. Syst., Man, Cybern. B, Cybern , vol.36 , Issue.4 , pp. 755-766
    • Willms, A.R.1    Yang, S.X.2
  • 2
    • 0028486137 scopus 로고
    • Using path transforms to guide the search for findpath in 2D
    • A. Zelinsky, "Using path transforms to guide the search for findpath in 2D," Int. J. Robot. Res., vol. 13, no. 4, pp. 315-325, 1994.
    • (1994) Int. J. Robot. Res , vol.13 , Issue.4 , pp. 315-325
    • Zelinsky, A.1
  • 3
    • 0022927138 scopus 로고
    • Distance transformations in digital images
    • Jun
    • G. Borgefors, "Distance transformations in digital images," Comput. Vis., Graph., Image Process., vol. 34, no. 3, pp. 344-371, Jun. 1986.
    • (1986) Comput. Vis., Graph., Image Process , vol.34 , Issue.3 , pp. 344-371
    • Borgefors, G.1
  • 4
    • 0026852378 scopus 로고
    • A mathematical morphology approach to Euclidean distance transformation
    • Apr
    • F. Y.-C. Shih and O. R. Mitchell, "A mathematical morphology approach to Euclidean distance transformation," IEEE Trans. Image Process. vol. 1, no. 2, pp. 197-204, Apr. 1992.
    • (1992) IEEE Trans. Image Process , vol.1 , Issue.2 , pp. 197-204
    • Shih, F.Y.-C.1    Mitchell, O.R.2
  • 5
    • 0032187559 scopus 로고    scopus 로고
    • Finding the optimal driving path of a car using the modified constrained distance transformation
    • Oct
    • S.-C. Pei and J.-H. Horng, "Finding the optimal driving path of a car using the modified constrained distance transformation," IEEE Trans. Robot. Autom., vol. 14, no. 5, pp. 663-670, Oct. 1998.
    • (1998) IEEE Trans. Robot. Autom , vol.14 , Issue.5 , pp. 663-670
    • Pei, S.-C.1    Horng, J.-H.2
  • 9
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Jul
    • P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern., vol. SSC-4, no. 2, pp. 100-107, Jul. 1968.
    • (1968) IEEE Trans. Syst. Sci. Cybern , vol.SSC-4 , Issue.2 , pp. 100-107
    • Hart, P.E.1    Nilsson, N.J.2    Raphael, B.3
  • 10
    • 0028055356 scopus 로고
    • Optimal and efficient path planning for partially-known environments
    • A. Stentz, "Optimal and efficient path planning for partially-known environments," in Proc. IEEE Int. Conf. Robot. Autom., 1994, pp. 3310-3317.
    • (1994) Proc. IEEE Int. Conf. Robot. Autom , pp. 3310-3317
    • Stentz, A.1
  • 12
    • 85168140233 scopus 로고
    • The focused D* algorithm for real-time replanning
    • A. Stentz, "The focused D* algorithm for real-time replanning," in Proc. Int. Joint Conf. Artif. Intell., 1995, pp. 1652-1659.
    • (1995) Proc. Int. Joint Conf. Artif. Intell , pp. 1652-1659
    • Stentz, A.1
  • 13
    • 20844432827 scopus 로고    scopus 로고
    • Fast replanning for navigation in unknown terrain
    • Jun
    • S. Koenig and M. Likhachev, "Fast replanning for navigation in unknown terrain," IEEE Trans. Robot., vol. 21, no. 3, pp. 354-363, Jun. 2005.
    • (2005) IEEE Trans. Robot , vol.21 , Issue.3 , pp. 354-363
    • Koenig, S.1    Likhachev, M.2
  • 14
    • 44849091447 scopus 로고    scopus 로고
    • R. Philippsen, Motion planning and obstacle avoidance for mobile robots in highly cluttered dynamic environments, Ph.D. dissertation, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland, 2004. [Online]. Available: http://library.epfl.ch/en/theses/?nr=3146
    • R. Philippsen, "Motion planning and obstacle avoidance for mobile robots in highly cluttered dynamic environments," Ph.D. dissertation, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland, 2004. [Online]. Available: http://library.epfl.ch/en/theses/?nr=3146
  • 15
    • 0029024671 scopus 로고
    • Neural network dynamics for path planning and obstacle avoidance
    • R. Glasius, A. Komoda, and S. C. A. M. Gielen, "Neural network dynamics for path planning and obstacle avoidance," Neural Netw., vol. 8, no. 1, pp. 125-133, 1995.
    • (1995) Neural Netw , vol.8 , Issue.1 , pp. 125-133
    • Glasius, R.1    Komoda, A.2    Gielen, S.C.A.M.3
  • 16
    • 0029030403 scopus 로고
    • A real-time, unsupervised neural network for the low-level control of a mobile robot in a nonstationary environment
    • E. Zalama, P. Gaudiano, and J. L. Coronado, "A real-time, unsupervised neural network for the low-level control of a mobile robot in a nonstationary environment," Neural Netw., vol. 8, no. 1, pp. 103-123, 1995.
    • (1995) Neural Netw , vol.8 , Issue.1 , pp. 103-123
    • Zalama, E.1    Gaudiano, P.2    Coronado, J.L.3
  • 17
    • 0034249227 scopus 로고    scopus 로고
    • An efficient neural network method for realtime motion planning with safety consideration
    • Aug
    • S. X. Yang and M. Meng, "An efficient neural network method for realtime motion planning with safety consideration," Robot. Auton. Syst., vol. 32, no. 2/3, pp. 115-128, Aug. 2000.
    • (2000) Robot. Auton. Syst , vol.32 , Issue.2-3 , pp. 115-128
    • Yang, S.X.1    Meng, M.2
  • 18
    • 0035360031 scopus 로고    scopus 로고
    • Neural network approaches to dynamic collision-free robot trajectory generation
    • Jun
    • S. X. Yang and M. Meng, "Neural network approaches to dynamic collision-free robot trajectory generation," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 31, no. 3, pp. 302-318, Jun. 2001.
    • (2001) IEEE Trans. Syst., Man, Cybern. B, Cybern , vol.31 , Issue.3 , pp. 302-318
    • Yang, S.X.1    Meng, M.2
  • 20
    • 19344367169 scopus 로고    scopus 로고
    • The dynamic wave expansion neural network model for robot motion planning in time-varying environments
    • Apr
    • D. V. Lebedev, J. J. Steil, and H. J. Ritter, "The dynamic wave expansion neural network model for robot motion planning in time-varying environments," Neural Netw., vol. 18, no. 3, pp. 267-285, Apr. 2005.
    • (2005) Neural Netw , vol.18 , Issue.3 , pp. 267-285
    • Lebedev, D.V.1    Steil, J.J.2    Ritter, H.J.3
  • 21
    • 0034877996 scopus 로고    scopus 로고
    • Motion planning in dynamic environments: Obstacles moving along arbitrary trajectories
    • Z. Shiller, F. Large, and S. Sekhavat, "Motion planning in dynamic environments: Obstacles moving along arbitrary trajectories," in Proc. IEEE Int. Conf. Robot. Autom., 2001, vol. 4, pp. 3716-3721.
    • (2001) Proc. IEEE Int. Conf. Robot. Autom , vol.4 , pp. 3716-3721
    • Shiller, Z.1    Large, F.2    Sekhavat, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.