메뉴 건너뛰기




Volumn , Issue , 2009, Pages 3955-3960

Decomposition algorithm for global reachability analysis on a time-varying graph with an application to planetary exploration

Author keywords

Block triangular matrix; Decomposition; Dijkstra's algorithm; Reachability

Indexed keywords

ADJACENCY MATRICES; COMPUTATIONAL ASPECTS; DECOMPOSITION ALGORITHM; DIJKSTRA'S ALGORITHMS; EXPLORATION MISSIONS; GRAPH SEARCH; HIGHLY NONLINEAR; HORIZONTAL WINDS; HOT AIR; MEMORY REQUIREMENTS; PLANETARY EXPLORATION; PLANNING PROBLEM; POSSIBLE FUTURES; PROBLEM SIZE; REACHABILITY; REACHABILITY ANALYSIS; SUB-PROBLEMS; TIME GRID; TIME VARYING; TIME-SCALES; TRAJECTORY PLANNING; TRIANGULAR MATRICES; VEHICLE SYSTEM; WIND FIELD;

EID: 76249086506     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2009.5354578     Document Type: Conference Paper
Times cited : (13)

References (12)
  • 7
    • 76249110389 scopus 로고    scopus 로고
    • Path planning and global reachability for planetary exploration with montgolfiere balloons
    • submitted to Robotics: Science and Systems
    • L. Blackmore, Y. Kuwata, M. Wolf, C. Assad, N. Fathpour, C. Newman, and A. Elfes, "Path planning and global reachability for planetary exploration with montgolfiere balloons," submitted to Robotics: Science and Systems.
    • Blackmore, L.1    Kuwata, Y.2    Wolf, M.3    Assad, C.4    Fathpour, N.5    Newman, C.6    Elfes, A.7
  • 8
    • 0032690320 scopus 로고    scopus 로고
    • Trajectory planning in a dynamic workspace: A 'state-time space' approach
    • T. Fraichard, "Trajectory planning in a dynamic workspace: a 'state-time space' approach," Advanced Robotics, vol. 13, no. 1, pp. 75-94, 1999.
    • (1999) Advanced Robotics , vol.13 , Issue.1 , pp. 75-94
    • Fraichard, T.1
  • 9
    • 27144517666 scopus 로고    scopus 로고
    • Roadmap-Based Motion Planning in Dynamic Environments
    • J. van den Berg and M. Overmars, "Roadmap-Based Motion Planning in Dynamic Environments," IEEE Transactions on Robotics, vol. 21, pp. 885-897, 2005.
    • (2005) IEEE Transactions on Robotics , vol.21 , pp. 885-897
    • van den Berg, J.1    Overmars, M.2
  • 10
    • 0038277189 scopus 로고    scopus 로고
    • Optimal trajectory planning for hot-air balloons in linear wind fields
    • T. Das, R. Mukherjee, and J. Cameron, "Optimal trajectory planning for hot-air balloons in linear wind fields," AIAA Journal of Guidance, Control, and Dynamics, vol. 26, no. 3, pp. 416-424, 2003.
    • (2003) AIAA Journal of Guidance, Control, and Dynamics , vol.26 , Issue.3 , pp. 416-424
    • Das, T.1    Mukherjee, R.2    Cameron, J.3
  • 11
    • 36249024153 scopus 로고    scopus 로고
    • PlanetWRF: A general purpose, local to global numerical model for planetary atmospheric and climate dynamics
    • M. I. Richardson, A. D. Toigo, and C. E. Newman, "PlanetWRF: A general purpose, local to global numerical model for planetary atmospheric and climate dynamics," Journal of Geophysical Research, vol. 112, 2007.
    • (2007) Journal of Geophysical Research , vol.112
    • Richardson, M.I.1    Toigo, A.D.2    Newman, C.E.3
  • 12
    • 5644255767 scopus 로고    scopus 로고
    • Algorithm alley - heaps are usually implemented via binary trees, with the property that for every subtree, the root is the minimum item. here, John describes how to implement exceptionally fast 'Fibonacci' heaps
    • Jan
    • J. Boyer, "Algorithm alley - heaps are usually implemented via binary trees, with the property that for every subtree, the root is the minimum item. here, John describes how to implement exceptionally fast 'Fibonacci' heaps," Dr. Dobb's Journal of Software Tools, vol. 22, no. 1, pp. 106, Jan. 1997.
    • (1997) Dr. Dobb's Journal of Software Tools , vol.22 , Issue.1 , pp. 106
    • Boyer, J.1


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