Geometric Shortest Paths and Network Optimization (1998)

by Joseph S.B. Mitchell
Venue:Handbook of Computational Geometry
Citations:146 - 12 self

Active Bibliography

18 Approximation Algorithms for Curvature-Constrained Shortest Paths – Hongyan Wang, Pankaj K. Agarwal - 1996
7 Nonuniform Discretization For Kinodynamic Motion Planning And Its Applications – John H. Reif, Hongyan Wang - 2000
24 Non-Uniform Discretization Approximations for Kinodynamic Motion Planning and its Applications – John Reif, Hongyan Wang - 1996
Optimal Path Finding in Direction, Location and Time Dependent Environments – Irina Sergeyevna Dolinskaya - 2009
DIFFERENTIALLY CONSTRAINED MOTION PLANNING WITH STATE LATTICE MOTION PRIMITIVES – Mihail N. Pivtoraiko, Matt Mason, Tony Stentz - 2012
30 A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature amidst Moderate Obstacles – Jean-daniel Boissonnat, Sylvain Lazard - 1996
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract) – Pankaj K. Argarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides - 1998
19 Curvature-constrained shortest paths in a convex polygon (Extended Abstract) – Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides - 2002
18 Sampling-Based Motion Planning with Differential Constraints – Peng Cheng - 2005
7 Optimal, Smooth, Nonholonomic Mobile Robot Motion Planning in State Lattices – Mihail Pivtoraiko, Alonzo Kelly - 2007
64 Guidelines in nonholonomic motion planning for mobile robots – Jean-paul Laumond , S. Sekhavat, F. Lamiraux - 1998
28 Obstacle Distance for Car-Like Robots – M. Vendittelli, J. P. Laumond, C. Nissoux - 1999
1 GEODESIC PROBLEMS FOR MOBILE ROBOTS – Hamid Reza Chitsaz - 2008
26 Approximation Algorithms for Lawn Mowing and Milling – Esther M. Arkin, Sandor P. Fekete, Joseph S. B. Mitchell - 1993
Approximation algorithms for lawn mowing and milling ✩ – Esther M. Arkin A, Sándor P. Fekete B, Joseph S. B. Mitchell A - 1997
20 Differentially Constrained Mobile Robot Motion Planning in State Lattices – Mihail Pivtoraiko, Alonzo Kelly - 2008
14 Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings – Ezra Miller, Igor Pak - 2003
A Novel Solution to the ATT48 Benchmark Problem – Anthony A. Ruffa - 2008
13 The approximability of NP-hard problems – Sanjeev Arora - 1998