{"id":"https://openalex.org/W3046639050","doi":"https://doi.org/10.23919/ecc51009.2020.9143597","title":"A novel formalisation of the Markov-Dubins problem","display_name":"A novel formalisation of the Markov-Dubins problem","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3046639050","doi":"https://doi.org/10.23919/ecc51009.2020.9143597","mag":"3046639050"},"language":"en","primary_location":{"id":"doi:10.23919/ecc51009.2020.9143597","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc51009.2020.9143597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.23919/ECC51009.2020.9143597","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000093663","display_name":"Paolo Bevilacqua","orcid":"https://orcid.org/0000-0003-0695-481X"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Bevilacqua","raw_affiliation_strings":["Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]},{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080554397","display_name":"Marco Frego","orcid":"https://orcid.org/0000-0003-2855-9052"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Frego","raw_affiliation_strings":["Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]},{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045097296","display_name":"Daniele Fontanelli","orcid":"https://orcid.org/0000-0002-5486-9989"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"D. Fontanelli","raw_affiliation_strings":["Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]},{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006224560","display_name":"Luigi Palopoli","orcid":"https://orcid.org/0000-0001-8813-8685"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Palopoli","raw_affiliation_strings":["Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell\u2019Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]},{"raw_affiliation_string":"Dipartimento di Ingegneria e Scienza dell'Informazione, University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193223587"],"apc_list":null,"apc_paid":null,"fwci":0.4264,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68195111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1987","last_page":"1992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5711958408355713},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5544650554656982},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47520121932029724},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45145830512046814},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44060370326042175},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4327758848667145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4213825464248657},{"id":"https://openalex.org/keywords/conformal-map","display_name":"Conformal map","score":0.4163752794265747},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.38798853754997253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3261004090309143},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28899455070495605},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11019882559776306}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5711958408355713},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5544650554656982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47520121932029724},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45145830512046814},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44060370326042175},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4327758848667145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4213825464248657},{"id":"https://openalex.org/C98214594","wikidata":"https://www.wikidata.org/wiki/Q850275","display_name":"Conformal map","level":2,"score":0.4163752794265747},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38798853754997253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3261004090309143},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28899455070495605},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11019882559776306},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/ecc51009.2020.9143597","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc51009.2020.9143597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 European Control Conference (ECC)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unitn.it:11572/285931","is_oa":false,"landing_page_url":"http://hdl.handle.net/11572/285931","pdf_url":null,"source":{"id":"https://openalex.org/S4377196320","display_name":"Iris (University of Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:unibz.it:11342425420001241","is_oa":true,"landing_page_url":"https://doi.org/10.23919/ECC51009.2020.9143597","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":{"id":"pmh:oai:unibz.it:11342425420001241","is_oa":true,"landing_page_url":"https://doi.org/10.23919/ECC51009.2020.9143597","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1598760690","https://openalex.org/W1604130472","https://openalex.org/W1963641530","https://openalex.org/W1999910477","https://openalex.org/W2058786336","https://openalex.org/W2134638269","https://openalex.org/W2140018923","https://openalex.org/W2148761022","https://openalex.org/W2216368278","https://openalex.org/W2313274380","https://openalex.org/W2573764450","https://openalex.org/W2577354006","https://openalex.org/W2587537338","https://openalex.org/W2606677490","https://openalex.org/W2800914593","https://openalex.org/W2808197004","https://openalex.org/W2896943870","https://openalex.org/W2914986345","https://openalex.org/W2951740426","https://openalex.org/W2962977210","https://openalex.org/W3103341201","https://openalex.org/W6635995158","https://openalex.org/W6755646560"],"related_works":["https://openalex.org/W1971223889","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W2173406670","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W4385301946","https://openalex.org/W2015716952"],"abstract_inverted_index":{"The":[0],"Markov-Dubins":[1],"problem":[2,34,92,130,159],"requires":[3],"to":[4,16,30,38,83,89,116,138,142],"find":[5],"the":[6,39,57,67,84,91,114,126,129,143,157],"shortest":[7],"path":[8],"that":[9,51,60,164],"connects":[10],"an":[11,32,70,153],"initial":[12],"point":[13,19],"and":[14,20,42,111],"angle":[15,21],"a":[17,48,54,75,94,106,132],"final":[18],"with":[22,35,43,53,66,136],"bounded":[23,44],"turning":[24],"radius.":[25],"Formally,":[26],"this":[27],"is":[28,150],"equivalent":[29],"solve":[31,117],"interpolation":[33],"continuity":[36],"up":[37],"first":[40],"derivative":[41],"curvature.":[45],"We":[46],"propose":[47],"mathematical":[49],"framework":[50],"models":[52],"single":[55],"equation":[56],"different":[58],"cases":[59],"arise,":[61],"i.e.,":[62],"we":[63],"can":[64,102],"represent":[65],"same":[68],"function":[69],"arc":[71],"of":[72,128,156,160],"circle":[73],"or":[74],"line":[76],"segment":[77],"by":[78],"smoothly":[79],"blending":[80],"from":[81],"one":[82],"other.":[85],"This":[86,148],"allows":[87],"us":[88],"restate":[90],"as":[93],"standard":[95,107],"Mixed":[96],"Integer":[97],"Nonlinear":[98,108],"Programming":[99,109],"(MINLP),":[100],"which":[101],"be":[103,166],"relaxed":[104],"into":[105],"(NLP)":[110],"therefore":[112],"opens":[113],"way":[115,135],"it":[118],"using":[119],"off-the-shelf":[120],"solvers.":[121],"Moreover,":[122],"our":[123],"formalism":[124],"captures":[125],"symmetries":[127],"in":[131,168],"more":[133],"intuitive":[134],"respect":[137],"previous":[139],"works,":[140],"thanks":[141],"considered":[144],"conformal":[145],"bipolar":[146],"transform.":[147],"approach":[149],"suitable":[151],"for":[152],"effective":[154],"solution":[155],"extended":[158],"connecting":[161],"multiple":[162],"points,":[163],"will":[165],"addressed":[167],"future":[169],"research.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}