Show simple item record

dc.contributor.authorManyam, Satyanarayana G.
dc.contributor.authorRathinam, Sivakumar
dc.date.accessioned2019-02-28T11:13:14Z
dc.date.available2019-02-28T11:13:14Z
dc.date.copyright3/7/2018 12:00:00 AM
dc.date.issued2018
dc.identifier.issn0022-0434
dc.identifier.otherds_140_07_071013.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4253980
dc.description.abstractThe Dubins traveling salesman problem (DTSP) has generated significant interest over the last decade due to its occurrence in several civil and military surveillance applications. This problem requires finding a curvature constrained shortest path for a vehicle visiting a set of target locations. Currently, there is no algorithm that can find an optimal solution to the DTSP. In addition, relaxing the motion constraints and solving the resulting Euclidean traveling salesman problem (ETSP) provide the only lower bound available for the DTSP. However, in many problem instances, the lower bound computed by solving the ETSP is far below the cost of the feasible solutions obtained by some well-known algorithms for the DTSP. This paper addresses this fundamental issue and presents the first systematic procedure for developing tight lower bounds for the DTSP.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleOn Tightly Bounding the Dubins Traveling Salesman's Optimum
dc.typeJournal Paper
dc.journal.volume140
dc.journal.issue7
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4039099
dc.journal.fristpage71013
dc.journal.lastpage071013-12
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2018:;volume( 140 ):;issue: 007
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record