메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 1734-1740

Discrete Approximations to Continuous Shortest-Path: Application to Minimum-Risk Path Planning for Groups of UAVs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANISOTROPY; COSTS; HAMILTONIANS; INTEGRATION; MATHEMATICAL INSTRUMENTS; OPTIMIZATION; PROBLEM SOLVING;

EID: 1542290172     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (34)

References (20)
  • 5
    • 0032002953 scopus 로고    scopus 로고
    • Implementation of efficient algorithms for globally optimal trajectories
    • Feb.
    • L. C. Polymenakos, D. P. Bertsekas, and J. N. Tsitsiklis. Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. on Automat. Contr., 43(2):278-283, Feb. 1998.
    • (1998) IEEE Trans. on Automat. Contr. , vol.43 , Issue.2 , pp. 278-283
    • Polymenakos, L.C.1    Bertsekas, D.P.2    Tsitsiklis, J.N.3
  • 7
    • 0003814292 scopus 로고
    • Selected Publications in the Mathematical Sciences. Prentice-Hall, Englewood Cliffs, N.J.
    • I. M. Gelfand and S. V. Fomin. Calculus of Variations. Selected Publications in the Mathematical Sciences. Prentice-Hall, Englewood Cliffs, N. J., 1963.
    • (1963) Calculus of Variations
    • Gelfand, I.M.1    Fomin, S.V.2
  • 8
    • 0033330745 scopus 로고    scopus 로고
    • An optimal algorithm for euclidean shortest paths in the plane
    • ISSN 0097-5397
    • J. Hershberger and S. Suri. An optimal algorithm for euclidean shortest paths in the plane. SIAM J. on Computing, 28(6):2215-2256, 1999. ISSN 0097-5397.
    • (1999) SIAM J. on Computing , vol.28 , Issue.6 , pp. 2215-2256
    • Hershberger, J.1    Suri, S.2
  • 9
    • 0031502943 scopus 로고    scopus 로고
    • An efficient algorithm for euclidean shortest paths among polygonal obstacles in the plane
    • S. Kapoor, S. N. Maheshwari, and J. S. B. Mitchell. An efficient algorithm for euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geometry, 18:377-383, 1997.
    • (1997) Discrete Comput. Geometry , vol.18 , pp. 377-383
    • Kapoor, S.1    Maheshwari, S.N.2    Mitchell, J.S.B.3
  • 11
    • 84887422667 scopus 로고    scopus 로고
    • Shortest anisotropic paths on terrains
    • In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proc. 26th Int. Colloquium Automata, Languages and Programming (ICALP'99). Springer-Verlag, Berlin
    • M. Lanthier, A. Maheshwari, and J.-R. Sack. Shortest anisotropic paths on terrains. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proc. 26th Int. Colloquium Automata, Languages and Programming (ICALP'99), volume 1644 of Lecture Notes in Computer Science, pages 524-533. Springer-Verlag, Berlin, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1644 , pp. 524-533
    • Lanthier, M.1    Maheshwari, A.2    Sack, J.-R.3
  • 12
    • 0030651636 scopus 로고    scopus 로고
    • A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
    • ACM Press. ISBN 0-89791-878-9
    • C. S. Mata and J. S. B. Mitchell. A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract). In Proc. of the thirteenth annual symposium on Computational geometry, pages 264-273. ACM Press, 1997. ISBN 0-89791-878-9.
    • (1997) Proc. of the Thirteenth Annual Symposium on Computational Geometry , pp. 264-273
    • Mata, C.S.1    Mitchell, J.S.B.2
  • 14
    • 0025800853 scopus 로고
    • The weighted region problem: Finding shortest paths through a weighted planar subdivision
    • ISSN 0004-5411
    • J. S. B. Mitchell and C. H. Papadimitriou. The weighted region problem: finding shortest paths through a weighted planar subdivision. of the ACM, 38(1):18-73, 1991. ISSN 0004-5411.
    • (1991) J. of the ACM , vol.38 , Issue.1 , pp. 18-73
    • Mitchell, J.S.B.1    Papadimitriou, C.H.2
  • 16
    • 0036475922 scopus 로고    scopus 로고
    • Mesh stability of look-ahead interconnected systems
    • Feb.
    • A. Pant, P. Seiler, and K. Hedrick. Mesh stability of look-ahead interconnected systems. IEEE Trans. on Automat. Contr., 47(2):403-407, Feb. 2002.
    • (2002) IEEE Trans. on Automat. Contr. , vol.47 , Issue.2 , pp. 403-407
    • Pant, A.1    Seiler, P.2    Hedrick, K.3
  • 17
    • 0025498445 scopus 로고
    • Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects
    • Oct.
    • N. C. Rowe and R. S. Ross. Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects. IEEE Trans. Robot. Automat., 6(5):540-553, Oct. 1990.
    • (1990) IEEE Trans. Robot. Automat. , vol.6 , Issue.5 , pp. 540-553
    • Rowe, N.C.1    Ross, R.S.2
  • 19
    • 0031121629 scopus 로고    scopus 로고
    • Optimal obstacle avoidance based on the hamilton-jacobi-bellman equation
    • S. Sundar and Z. Shiller. Optimal obstacle avoidance based on the hamilton-jacobi-bellman equation. IEEE Trans. Robot. Automat., 13 (2):305-310, 1997.
    • (1997) IEEE Trans. Robot. Automat. , vol.13 , Issue.2 , pp. 305-310
    • Sundar, S.1    Shiller, Z.2
  • 20
    • 0029373106 scopus 로고
    • Efficient algorithms for globally optimal trajectories
    • Sept.
    • J. N. Tsitsiklis. Efficient algorithms for globally optimal trajectories. IEEE Trans. on Automat. Contr., 40(9): 1528-1538, Sept. 1995.
    • (1995) IEEE Trans. on Automat. Contr. , vol.40 , Issue.9 , pp. 1528-1538
    • Tsitsiklis, J.N.1


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