DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, Hee-Kap | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Matousek, Jiri | ko |
dc.contributor.author | Vigneron, Antoine | ko |
dc.date.accessioned | 2013-03-11T22:57:13Z | - |
dc.date.available | 2013-03-11T22:57:13Z | - |
dc.date.created | 2012-03-07 | - |
dc.date.created | 2012-03-07 | - |
dc.date.issued | 2012-01 | - |
dc.identifier.citation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | http://hdl.handle.net/10203/100586 | - |
dc.description.abstract | Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P. we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n(2)) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. (C) 2011 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | CONSTRAINED SHORTEST PATHS | - |
dc.subject | TIME ALGORITHM | - |
dc.subject | LINEAR-TIME | - |
dc.subject | OBSTACLES | - |
dc.subject | CURVES | - |
dc.subject | PLANE | - |
dc.title | Reachability by paths of bounded curvature in a convex polygon | - |
dc.type | Article | - |
dc.identifier.wosid | 000296945500003 | - |
dc.identifier.scopusid | 2-s2.0-80053565782 | - |
dc.type.rims | ART | - |
dc.citation.volume | 45 | - |
dc.citation.issue | 1-2 | - |
dc.citation.beginningpage | 21 | - |
dc.citation.endingpage | 32 | - |
dc.citation.publicationname | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.identifier.doi | 10.1016/j.comgeo.2011.07.003 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Ahn, Hee-Kap | - |
dc.contributor.nonIdAuthor | Matousek, Jiri | - |
dc.contributor.nonIdAuthor | Vigneron, Antoine | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Motion planning | - |
dc.subject.keywordAuthor | Bounded curvature | - |
dc.subject.keywordAuthor | Convex polygon | - |
dc.subject.keywordPlus | CONSTRAINED SHORTEST PATHS | - |
dc.subject.keywordPlus | TIME ALGORITHM | - |
dc.subject.keywordPlus | LINEAR-TIME | - |
dc.subject.keywordPlus | OBSTACLES | - |
dc.subject.keywordPlus | CURVES | - |
dc.subject.keywordPlus | PLANE | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.