{"id":"https://openalex.org/W4404239427","doi":"https://doi.org/10.1109/icstcc62912.2024.10744736","title":"Planning strategy based on visibility graph and traveling salesman problem with time window constraints","display_name":"Planning strategy based on visibility graph and traveling salesman problem with time window constraints","publication_year":2024,"publication_date":"2024-10-10","ids":{"openalex":"https://openalex.org/W4404239427","doi":"https://doi.org/10.1109/icstcc62912.2024.10744736"},"language":"en","primary_location":{"id":"doi:10.1109/icstcc62912.2024.10744736","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icstcc62912.2024.10744736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 28th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114577800","display_name":"Mihaela-Alexandra Barb-Ciorbea","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Mihaela-Alexandra Barb-Ciorbea","raw_affiliation_strings":["\"Gheorghe Asachi\" Technical University of Iasi,Dept. of Automatic Control and Applied Informatics,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\"Gheorghe Asachi\" Technical University of Iasi,Dept. of Automatic Control and Applied Informatics,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046534630","display_name":"Marius Kloetzer","orcid":"https://orcid.org/0000-0003-4338-0421"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Marius Kloetzer","raw_affiliation_strings":["\"Gheorghe Asachi\" Technical University of Iasi,Dept. of Automatic Control and Applied Informatics,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\"Gheorghe Asachi\" Technical University of Iasi,Dept. of Automatic Control and Applied Informatics,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085504277","display_name":"Cristian Mahulea","orcid":"https://orcid.org/0000-0003-0056-2225"},"institutions":[{"id":"https://openalex.org/I255234318","display_name":"Universidad de Zaragoza","ror":"https://ror.org/012a91z28","country_code":"ES","type":"education","lineage":["https://openalex.org/I255234318"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Cristian Mahulea","raw_affiliation_strings":["University of Zaragoza,Aragón Institute of Engineering Research (I3A),Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Zaragoza,Aragón Institute of Engineering Research (I3A),Spain","institution_ids":["https://openalex.org/I255234318"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"521","last_page":"526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9733999967575073,"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.9733999967575073,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9686999917030334,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8492965698242188},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.6651287078857422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6393191814422607},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.6175288558006287},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.5654267072677612},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5054631233215332},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.47735595703125},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4284685552120209},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42694586515426636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29865992069244385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23676961660385132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19229039549827576},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06918585300445557}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8492965698242188},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.6651287078857422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6393191814422607},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.6175288558006287},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.5654267072677612},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5054631233215332},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.47735595703125},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4284685552120209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42694586515426636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29865992069244385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23676961660385132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19229039549827576},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06918585300445557},{"id":"https://openalex.org/C153294291","wikidata":"https://www.wikidata.org/wiki/Q25261","display_name":"Meteorology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icstcc62912.2024.10744736","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icstcc62912.2024.10744736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 28th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W107646379","https://openalex.org/W1424654272","https://openalex.org/W1507039213","https://openalex.org/W1521785144","https://openalex.org/W1969186119","https://openalex.org/W2013046023","https://openalex.org/W2029242918","https://openalex.org/W2042986967","https://openalex.org/W2074079079","https://openalex.org/W2093894544","https://openalex.org/W2113043717","https://openalex.org/W2123241324","https://openalex.org/W2141481566","https://openalex.org/W2151131571","https://openalex.org/W2399100674","https://openalex.org/W2497309204","https://openalex.org/W2594675090","https://openalex.org/W2753576362","https://openalex.org/W2998164266","https://openalex.org/W4242246215","https://openalex.org/W4242361212","https://openalex.org/W4302339081","https://openalex.org/W4392255398","https://openalex.org/W6632220198"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2101778208"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,7,52,57,102,137,151,156],"problem":[4,58,133],"of":[5,9,19,54,128],"planning":[6],"motion":[8],"a":[10,24,61,97,131,142],"mobile":[11],"robot":[12,35],"that":[13],"has":[14],"to":[15,106,115,122,155],"visit":[16],"some":[17],"points":[18,105,127],"interest,":[20],"each":[21],"point":[22],"having":[23],"specific":[25],"time":[26],"interval":[27],"in":[28,44],"which":[29],"it":[30,39,81,111],"can":[31],"be":[32,60,107],"reached.":[33],"The":[34,93,159],"is":[36,72,134,153,162],"omnidirectional":[37],"and":[38,80,90,104,109,126,150],"evolves":[40],"with":[41,48,65],"constant":[42],"speed":[43],"an":[45],"environment":[46],"cluttered":[47],"polygonal":[49],"obstacles.":[50],"In":[51],"case":[53],"no":[55],"obstacles,":[56],"would":[59],"Travelling":[62],"Salesman":[63],"Problem":[64],"Time":[66],"Window":[67],"(TSPTW)":[68],"constraints.":[69],"Our":[70],"solution":[71,152,160],"innovative":[73],"by":[74,84,140,164],"enabling":[75],"obstacles":[76,103],"for":[77],"TSPTW":[78,132],"scenarios,":[79],"accomplishes":[82],"this":[83,113],"coupling":[85],"visibility":[86,98],"graphs,":[87],"graph":[88,99,114,117,139],"reduction":[89],"mathematical":[91,148],"programming.":[92],"method":[94],"first":[95],"constructs":[96],"based":[100],"on":[101,136],"visited,":[108],"then":[110],"maps":[112],"another":[116],"whose":[118],"nodes":[119],"correspond":[120],"only":[121],"robot\u2019s":[123],"initial":[124,157],"position":[125],"interest.":[129],"Finally,":[130],"solved":[135],"reduced":[138],"using":[141],"Mixed":[143],"Integer":[144],"Linear":[145],"Programming":[146],"(MILP)":[147],"formulation,":[149],"projected":[154],"environment.":[158],"development":[161],"accompanied":[163],"illustrative":[165],"numerical":[166],"simulations.":[167]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}