DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goaoc, Xavier | ko |
dc.contributor.author | Kim, Hyo-Sil | ko |
dc.contributor.author | Lazard, Sylvain | ko |
dc.date.accessioned | 2013-08-08T06:07:39Z | - |
dc.date.available | 2013-08-08T06:07:39Z | - |
dc.date.created | 2013-06-11 | - |
dc.date.created | 2013-06-11 | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | SIAM JOURNAL ON COMPUTING, v.42, no.2, pp.662 - 684 | - |
dc.identifier.issn | 0097-5397 | - |
dc.identifier.uri | http://hdl.handle.net/10203/174949 | - |
dc.description.abstract | We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a subproblem of the Dubins traveling salesman problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are a distance of at least four apart, this question reduces to a family of convex optimization problems over polyhedra in R-n. | - |
dc.language | English | - |
dc.publisher | SIAM PUBLICATIONS | - |
dc.subject | ALGORITHM | - |
dc.title | BOUNDED-CURVATURE SHORTEST PATHS THROUGH A SEQUENCE OF POINTS USING CONVEX OPTIMIZATION | - |
dc.type | Article | - |
dc.identifier.wosid | 000318353800011 | - |
dc.identifier.scopusid | 2-s2.0-84880086697 | - |
dc.type.rims | ART | - |
dc.citation.volume | 42 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 662 | - |
dc.citation.endingpage | 684 | - |
dc.citation.publicationname | SIAM JOURNAL ON COMPUTING | - |
dc.identifier.doi | 10.1137/100816079 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.nonIdAuthor | Goaoc, Xavier | - |
dc.contributor.nonIdAuthor | Lazard, Sylvain | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | path planning | - |
dc.subject.keywordAuthor | bounded curvature | - |
dc.subject.keywordAuthor | Dubins path | - |
dc.subject.keywordAuthor | convex optimization | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.