메뉴 건너뛰기




Volumn 56, Issue 4, 2008, Pages 289-295

Real-time tour construction for a mobile robot in a dynamic environment

Author keywords

Mobile robot; Savings algorithm; Tour construction; TSP

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 40849130218     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.robot.2007.09.011     Document Type: Article
Times cited : (33)

References (27)
  • 5
    • 0029212654 scopus 로고
    • Optimal and efficient path planning for unknown and dynamic environments
    • Stentz A. Optimal and efficient path planning for unknown and dynamic environments. International Journal of Robotics & Automation 10 (1995) 89-100
    • (1995) International Journal of Robotics & Automation , vol.10 , pp. 89-100
    • Stentz, A.1
  • 8
    • 0036856028 scopus 로고    scopus 로고
    • Dynamic motion planning for mobile robots using potential field method
    • Ge S.S., and Cu Y.J. Dynamic motion planning for mobile robots using potential field method. Autonomous Robots 13 (2002) 207-222
    • (2002) Autonomous Robots , vol.13 , pp. 207-222
    • Ge, S.S.1    Cu, Y.J.2
  • 9
    • 0742321283 scopus 로고    scopus 로고
    • Real-time collision-free motion planning of a mobile robot using a neural dynamics-based approach
    • Yang S.X., and Meng M.Q.H. Real-time collision-free motion planning of a mobile robot using a neural dynamics-based approach. IEEE Transactions on Neural Networks 14 (2003) 1541-1552
    • (2003) IEEE Transactions on Neural Networks , vol.14 , pp. 1541-1552
    • Yang, S.X.1    Meng, M.Q.H.2
  • 10
    • 84957653168 scopus 로고    scopus 로고
    • Mobile robot path planning using genetic algorithms
    • Foundations and Tools for Neural Modeling, Proceedings
    • Thomaz C.E., Pacheco M.A.C., and Vellasco M.M.B.R. Mobile robot path planning using genetic algorithms. Foundations and Tools for Neural Modeling, Proceedings. Vol: I Lecture Notes in Computer Science vol. 1606 (1999) 671-679
    • (1999) Vol: I Lecture Notes in Computer Science , vol.1606 , pp. 671-679
    • Thomaz, C.E.1    Pacheco, M.A.C.2    Vellasco, M.M.B.R.3
  • 11
    • 0032154844 scopus 로고    scopus 로고
    • Path planning of a mobile robot using genetic heuristics
    • Nearchou A.C. Path planning of a mobile robot using genetic heuristics. Robotica 16 (1998) 575-588
    • (1998) Robotica , vol.16 , pp. 575-588
    • Nearchou, A.C.1
  • 12
    • 0348117202 scopus 로고    scopus 로고
    • Mobile robot path planning and tracking using simulated annealing and fuzzy logic control
    • Martinez-Alfaro H., and Gomez-Garcia S. Mobile robot path planning and tracking using simulated annealing and fuzzy logic control. Expert Systems with Applications 15 (1998) 421-429
    • (1998) Expert Systems with Applications , vol.15 , pp. 421-429
    • Martinez-Alfaro, H.1    Gomez-Garcia, S.2
  • 14
    • 14344264269 scopus 로고    scopus 로고
    • The traveling salesman problem applications, formulations and variations
    • Gutin G., and Punnen A.P. (Eds), Kluwer Academic Publishers
    • Punnen A. The traveling salesman problem applications, formulations and variations. In: Gutin G., and Punnen A.P. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer Academic Publishers 1-28
    • (2002) The Traveling Salesman Problem and its Variations , pp. 1-28
    • Punnen, A.1
  • 15
    • 0036951427 scopus 로고    scopus 로고
    • Z. Yu, L. Jinhai, G. Guochang, Z. Rubo, Y. Haiyan, An implementation of evolutionary computation for path planning of cooperative mobile robots, in: Proc 4th World Congress on Intelligent Control and Automation, Shanghai, 2002, pp. 1798-1802
    • Z. Yu, L. Jinhai, G. Guochang, Z. Rubo, Y. Haiyan, An implementation of evolutionary computation for path planning of cooperative mobile robots, in: Proc 4th World Congress on Intelligent Control and Automation, Shanghai, 2002, pp. 1798-1802
  • 16
    • 0032790197 scopus 로고    scopus 로고
    • Competition-based neural network for the multiple traveling salesmen problem with min-max objective
    • Somhom S., Modares A., and Enkawa T. Competition-based neural network for the multiple traveling salesmen problem with min-max objective. Computers & Operations Research 26 (1999) 395-407
    • (1999) Computers & Operations Research , vol.26 , pp. 395-407
    • Somhom, S.1    Modares, A.2    Enkawa, T.3
  • 17
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • Laporte G. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 231-247
    • (1992) European Journal of Operational Research , vol.59 , pp. 231-247
    • Laporte, G.1
  • 20
    • 40849146490 scopus 로고    scopus 로고
    • P. Moscato. http://www.densis.fee.unicamp.br/ moscato/TSPBIB_home.html, 2006
    • P. Moscato. http://www.densis.fee.unicamp.br/ moscato/TSPBIB_home.html, 2006
  • 21
    • 40849115694 scopus 로고    scopus 로고
    • TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/, TSPLIB95, 2006
    • TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/, TSPLIB95, 2006
  • 22
    • 0001596897 scopus 로고
    • Empirical analysis of heuristics
    • Lawler, et al. (Ed), John Wiley & Sons, New York
    • Golden B.L., and Stewart W.L. Empirical analysis of heuristics. In: Lawler, et al. (Ed). The Traveling Salesman Problem (1985), John Wiley & Sons, New York 207-249
    • (1985) The Traveling Salesman Problem , pp. 207-249
    • Golden, B.L.1    Stewart, W.L.2
  • 25
    • 40849123471 scopus 로고    scopus 로고
    • ActivMedia Robotics Inc. www.mobilerobots.com
    • ActivMedia Robotics Inc. www.mobilerobots.com
  • 26
    • 40849138722 scopus 로고    scopus 로고
    • Aria-Manual: 2003, Aria Reference Manual 1.3.2, Sep 7
    • Aria-Manual: 2003, Aria Reference Manual 1.3.2, Sep 7
  • 27
    • 40849095291 scopus 로고    scopus 로고
    • http://www.ai-robotlab.ogu.edu.tr


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