首页 /研究 /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

发表年份
2017
引用次数
60

关键词

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

相关论文

查看 OTHER 分类全部论文