Min-Time Escape of a Dubins Car from a Polygon Article Swipe
Isaac E. Weintraub
,
Alexander Von Moll
,
David W. Casbeer
,
Satyanarayana G. Manyam
,
Meir Pachter
,
Colin Taylor
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2410.01589
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2410.01589
A turn constrained vehicle is initially located inside a polygon region and desires to escape in minimum time. First, the method of characteristics is used to describe the time-optimal strategies for reaching a line of infinite length. Next, the approach is extended to polygons constructed of a series of line segments. Using this construction technique, the min-time path to reach each edge is obtained; the resulting minimum of the set of optimal trajectories is then selected for escaping the polygon.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2410.01589
- https://arxiv.org/pdf/2410.01589
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4403851785
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4403851785Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2410.01589Digital Object Identifier
- Title
-
Min-Time Escape of a Dubins Car from a PolygonWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-10-02Full publication date if available
- Authors
-
Isaac E. Weintraub, Alexander Von Moll, David W. Casbeer, Satyanarayana G. Manyam, Meir Pachter, Colin TaylorList of authors in order
- Landing page
-
https://arxiv.org/abs/2410.01589Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2410.01589Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2410.01589Direct OA link when available
- Concepts
-
Polygon (computer graphics), Computer science, Mathematical optimization, Mathematics, Computer network, Frame (networking)Top concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4403851785 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2410.01589 |
| ids.doi | https://doi.org/10.48550/arxiv.2410.01589 |
| ids.openalex | https://openalex.org/W4403851785 |
| fwci | |
| type | preprint |
| title | Min-Time Escape of a Dubins Car from a Polygon |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12504 |
| topics[0].field.id | https://openalex.org/fields/26 |
| topics[0].field.display_name | Mathematics |
| topics[0].score | 0.7265999913215637 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2608 |
| topics[0].subfield.display_name | Geometry and Topology |
| topics[0].display_name | Mathematics and Applications |
| topics[1].id | https://openalex.org/T11615 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.7160999774932861 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2207 |
| topics[1].subfield.display_name | Control and Systems Engineering |
| topics[1].display_name | Control and Dynamics of Mobile Robots |
| topics[2].id | https://openalex.org/T10586 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.6585000157356262 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1707 |
| topics[2].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[2].display_name | Robotic Path Planning Algorithms |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C190694206 |
| concepts[0].level | 3 |
| concepts[0].score | 0.5616358518600464 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q3276654 |
| concepts[0].display_name | Polygon (computer graphics) |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.4294319450855255 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.3246971666812897 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C33923547 |
| concepts[3].level | 0 |
| concepts[3].score | 0.32087427377700806 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[3].display_name | Mathematics |
| concepts[4].id | https://openalex.org/C31258907 |
| concepts[4].level | 1 |
| concepts[4].score | 0.062473177909851074 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[4].display_name | Computer network |
| concepts[5].id | https://openalex.org/C126042441 |
| concepts[5].level | 2 |
| concepts[5].score | 0.0 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1324888 |
| concepts[5].display_name | Frame (networking) |
| keywords[0].id | https://openalex.org/keywords/polygon |
| keywords[0].score | 0.5616358518600464 |
| keywords[0].display_name | Polygon (computer graphics) |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.4294319450855255 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.3246971666812897 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/mathematics |
| keywords[3].score | 0.32087427377700806 |
| keywords[3].display_name | Mathematics |
| keywords[4].id | https://openalex.org/keywords/computer-network |
| keywords[4].score | 0.062473177909851074 |
| keywords[4].display_name | Computer network |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2410.01589 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2410.01589 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2410.01589 |
| locations[1].id | doi:10.48550/arxiv.2410.01589 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2410.01589 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5012771152 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Isaac E. Weintraub |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Weintraub, Isaac E. |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5059633067 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7661-5752 |
| authorships[1].author.display_name | Alexander Von Moll |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Von Moll, Alexander |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5029454978 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-7065-7337 |
| authorships[2].author.display_name | David W. Casbeer |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Casbeer, David |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5086282802 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0881-5672 |
| authorships[3].author.display_name | Satyanarayana G. Manyam |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Manyam, Satyanarayana G |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5030813743 |
| authorships[4].author.orcid | https://orcid.org/0000-0003-0584-6913 |
| authorships[4].author.display_name | Meir Pachter |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Pachter, Meir |
| authorships[4].is_corresponding | False |
| authorships[5].author.id | https://openalex.org/A5018653323 |
| authorships[5].author.orcid | |
| authorships[5].author.display_name | Colin Taylor |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Taylor, Colin |
| authorships[5].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2410.01589 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Min-Time Escape of a Dubins Car from a Polygon |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T12504 |
| primary_topic.field.id | https://openalex.org/fields/26 |
| primary_topic.field.display_name | Mathematics |
| primary_topic.score | 0.7265999913215637 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2608 |
| primary_topic.subfield.display_name | Geometry and Topology |
| primary_topic.display_name | Mathematics and Applications |
| related_works | https://openalex.org/W2899084033, https://openalex.org/W2748952813, https://openalex.org/W4391375266, https://openalex.org/W1979597421, https://openalex.org/W2007980826, https://openalex.org/W2061531152, https://openalex.org/W3002753104, https://openalex.org/W2077600819, https://openalex.org/W2142036596, https://openalex.org/W2072657027 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2410.01589 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2410.01589 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2410.01589 |
| primary_location.id | pmh:oai:arXiv.org:2410.01589 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2410.01589 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2410.01589 |
| publication_date | 2024-10-02 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.A | 0 |
| abstract_inverted_index.a | 8, 32, 46 |
| abstract_inverted_index.in | 15 |
| abstract_inverted_index.is | 4, 23, 40, 62, 73 |
| abstract_inverted_index.of | 21, 34, 45, 48, 67, 70 |
| abstract_inverted_index.to | 13, 25, 42, 58 |
| abstract_inverted_index.and | 11 |
| abstract_inverted_index.for | 30, 76 |
| abstract_inverted_index.set | 69 |
| abstract_inverted_index.the | 19, 27, 38, 55, 64, 68, 78 |
| abstract_inverted_index.each | 60 |
| abstract_inverted_index.edge | 61 |
| abstract_inverted_index.line | 33, 49 |
| abstract_inverted_index.path | 57 |
| abstract_inverted_index.then | 74 |
| abstract_inverted_index.this | 52 |
| abstract_inverted_index.turn | 1 |
| abstract_inverted_index.used | 24 |
| abstract_inverted_index.Next, | 37 |
| abstract_inverted_index.Using | 51 |
| abstract_inverted_index.reach | 59 |
| abstract_inverted_index.time. | 17 |
| abstract_inverted_index.First, | 18 |
| abstract_inverted_index.escape | 14 |
| abstract_inverted_index.inside | 7 |
| abstract_inverted_index.method | 20 |
| abstract_inverted_index.region | 10 |
| abstract_inverted_index.series | 47 |
| abstract_inverted_index.desires | 12 |
| abstract_inverted_index.length. | 36 |
| abstract_inverted_index.located | 6 |
| abstract_inverted_index.minimum | 16, 66 |
| abstract_inverted_index.optimal | 71 |
| abstract_inverted_index.polygon | 9 |
| abstract_inverted_index.vehicle | 3 |
| abstract_inverted_index.approach | 39 |
| abstract_inverted_index.describe | 26 |
| abstract_inverted_index.escaping | 77 |
| abstract_inverted_index.extended | 41 |
| abstract_inverted_index.infinite | 35 |
| abstract_inverted_index.min-time | 56 |
| abstract_inverted_index.polygon. | 79 |
| abstract_inverted_index.polygons | 43 |
| abstract_inverted_index.reaching | 31 |
| abstract_inverted_index.selected | 75 |
| abstract_inverted_index.initially | 5 |
| abstract_inverted_index.obtained; | 63 |
| abstract_inverted_index.resulting | 65 |
| abstract_inverted_index.segments. | 50 |
| abstract_inverted_index.strategies | 29 |
| abstract_inverted_index.technique, | 54 |
| abstract_inverted_index.constrained | 2 |
| abstract_inverted_index.constructed | 44 |
| abstract_inverted_index.construction | 53 |
| abstract_inverted_index.time-optimal | 28 |
| abstract_inverted_index.trajectories | 72 |
| abstract_inverted_index.characteristics | 22 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 6 |
| citation_normalized_percentile |