Home /Research /Tightly Bounding the Shortest Dubins Paths Through a Sequence of Points
OTHER

Tightly Bounding the Shortest Dubins Paths Through a Sequence of Points

Satyanarayana G. Manyam, Sivakumar Rathinam, David W. Casbeer, Eloy García

Year
2017
Citations
60

Keywords

Bounding overwatchHeading (navigation)Interval (graph theory)Bounded functionSequence (biology)Shortest path problemMathematical optimizationMathematicsPath (computing)Upper and lower bounds

Related papers

Browse all OTHER papers