메뉴 건너뛰기




Volumn 21, Issue 4, 2002, Pages 331-344

Morse decompositions for coverage tasks

Author keywords

Cellular decompositions; Coverage; Morse functions

Indexed keywords

ALGORITHMS; FUNCTIONS; MOTION PLANNING; SENSORS; TOPOLOGY;

EID: 0036555892     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/027836402320556359     Document Type: Article
Times cited : (282)

References (27)
  • 1
    • 0036555876 scopus 로고    scopus 로고
    • Sensor-based coverage of unknown environments: Incremental construction of morse decompositions
    • Acar, E.U., and Choset, H. 2002. Sensor-based coverage of unknown environments: Incremental construction of morse decompositions, The Int. J. Robotics Research 21(4):345-366.
    • (2002) The Int. J. Robotics Research , vol.21 , Issue.4 , pp. 345-366
    • Acar, E.U.1    Choset, H.2
  • 2
    • 0001685025 scopus 로고
    • Critical points and curvature for embedded polyhedral surfaces
    • Banchoff, T.F. 1970. Critical points and curvature for embedded polyhedral surfaces. American Mathematical Monthly, 77:475-485.
    • (1970) American Mathematical Monthly , vol.77 , pp. 475-485
    • Banchoff, T.F.1
  • 4
    • 0024123325 scopus 로고
    • Constructing roadmaps of semi-algebraic sets I: Completeness
    • Canny, J.F. 1988. Constructing roadmaps of semi-algebraic sets I: Completeness. Artificial Intelligence 37:203-222.
    • (1988) Artificial Intelligence , vol.37 , pp. 203-222
    • Canny, J.F.1
  • 5
    • 0001372855 scopus 로고
    • An opportunistic global path planner
    • Canny, J.F., and Lin, M. 1993. An opportunistic global path planner. Algorithmica 10:102-120.
    • (1993) Algorithmica , vol.10 , pp. 102-120
    • Canny, J.F.1    Lin, M.2
  • 6
    • 0021475092 scopus 로고
    • Convex partition of polyhedra: A lower bound and worst-case optimal algorithm
    • Chazelle, B. 1984. Convex partition of polyhedra: A lower bound and worst-case optimal algorithm. SIAM Journal on Computing 13(3):488-507.
    • (1984) SIAM Journal on Computing , vol.13 , Issue.3 , pp. 488-507
    • Chazelle, B.1
  • 12
    • 0002910255 scopus 로고    scopus 로고
    • Morse theory for cell complexes
    • Forman, R. 1998. Morse theory for cell complexes. Advances in Mathematics 134:90-145.
    • (1998) Advances in Mathematics , vol.134 , pp. 90-145
    • Forman, R.1
  • 14
    • 0033330745 scopus 로고    scopus 로고
    • An optimal algorithm for euclidean shortest paths in the plane
    • Hershberger, J., and Suri, S. 1999. An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal on Computing 28(6):2215-2256.
    • (1999) SIAM Journal on Computing , vol.28 , Issue.6 , pp. 2215-2256
    • Hershberger, J.1    Suri, S.2
  • 15
    • 0022122750 scopus 로고
    • Collision free trajectory planning using distance transforms
    • Jarvis, R.A. 1985. Collision free trajectory planning using distance transforms. Mech. Eng. Trans. of the IE Aust. ME10:197-191.
    • (1985) Mech. Eng. Trans. of the IE Aust. , vol.ME10 , pp. 197-191
    • Jarvis, R.A.1
  • 16
    • 0022674420 scopus 로고
    • Real-time obstacle avoidance for manipulators and mobile robots
    • Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robotics Research 5(1):90-98.
    • (1986) Int. J. Robotics Research , vol.5 , Issue.1 , pp. 90-98
    • Khatib, O.1
  • 17
  • 18
    • 0004190360 scopus 로고
    • Princeton, New Jersey: Princeton University Press
    • Milnor, J. 1963. Morse Theory. Princeton, New Jersey: Princeton University Press.
    • (1963) Morse Theory
    • Milnor, J.1
  • 22
    • 0347647219 scopus 로고
    • On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds
    • Schwartz, J.T., and Sharir, M. 1983. On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 4(1):298-351.
    • (1983) Advances in Applied Mathematics , vol.4 , Issue.1 , pp. 298-351
    • Schwartz, J.T.1    Sharir, M.2
  • 24
  • 27
    • 0032651821 scopus 로고    scopus 로고
    • Shortest path planning for a tethered robot or an anchored cable
    • Detroit, MI
    • Xavier, P.G. 1999. Shortest path planning for a tethered robot or an anchored cable. In Proc. of IEEE ICRA, Detroit, MI, 2:1011-1017.
    • (1999) Proc. of IEEE ICRA , vol.2 , pp. 1011-1017
    • Xavier, P.G.1


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