{"id":"https://openalex.org/W2968564855","doi":"https://doi.org/10.23919/ecc.2019.8796048","title":"Time Optimal Tour Through a Class of Points for a Double Integrator Traveling Salesman","display_name":"Time Optimal Tour Through a Class of Points for a Double Integrator Traveling Salesman","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2968564855","doi":"https://doi.org/10.23919/ecc.2019.8796048","mag":"2968564855"},"language":"en","primary_location":{"id":"doi:10.23919/ecc.2019.8796048","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2019.8796048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 18th European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"article","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/A5090872324","display_name":"Eswara Venkata Kumar Dhulipala","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Eswara Venkata Kumar Dhulipala","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, New delhi, INDIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, New delhi, INDIA","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091652727","display_name":"Deepak U. Patil","orcid":"https://orcid.org/0000-0002-2897-2587"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak Patil","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, New delhi, INDIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, New delhi, INDIA","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2034,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5396413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3248","last_page":"3253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9951000213623047,"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.90721195936203},{"id":"https://openalex.org/keywords/integrator","display_name":"Integrator","score":0.6823819279670715},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6376563310623169},{"id":"https://openalex.org/keywords/double-integrator","display_name":"Double integrator","score":0.6176133155822754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5399127006530762},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.509372353553772},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.48030632734298706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4764692783355713},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4637731909751892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3121781349182129},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1575680375099182},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10098621249198914},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.09128189086914062},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.05983781814575195}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.90721195936203},{"id":"https://openalex.org/C79518650","wikidata":"https://www.wikidata.org/wiki/Q2081431","display_name":"Integrator","level":3,"score":0.6823819279670715},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6376563310623169},{"id":"https://openalex.org/C2779323837","wikidata":"https://www.wikidata.org/wiki/Q5300045","display_name":"Double integrator","level":3,"score":0.6176133155822754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5399127006530762},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.509372353553772},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.48030632734298706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4764692783355713},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4637731909751892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3121781349182129},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1575680375099182},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10098621249198914},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.09128189086914062},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.05983781814575195}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc.2019.8796048","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2019.8796048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 18th European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1587799944","https://openalex.org/W1967317811","https://openalex.org/W1969186119","https://openalex.org/W1970071808","https://openalex.org/W1971483538","https://openalex.org/W2096303367","https://openalex.org/W2123241324","https://openalex.org/W2137880701","https://openalex.org/W2148761022","https://openalex.org/W2167443851","https://openalex.org/W2313274380","https://openalex.org/W2341171179","https://openalex.org/W4296154082"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W8433631"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,9,34,45,68,97],"double":[4],"integrator":[5],"traveling":[6],"salesman":[7],"visiting":[8],"given":[10],"set":[11],"of":[12,38,48,61,71,73,84,96,99],"points":[13,49,75,85],"in":[14,50,76,94,101],"phase":[15,52,78,102],"plane":[16,53,79],"and":[17],"coming":[18],"back":[19],"to":[20],"the":[21,40,51,77,88],"starting":[22],"point":[23,28],"is":[24,29,54,80,90,92],"considered.":[25,55],"Also,":[26],"each":[27],"visited":[30],"only":[31],"once":[32],"during":[33],"tour.":[35],"The":[36,82],"problem":[37],"finding":[39],"time":[41,60,64],"optimal":[42,59,65],"tour":[43,66,74],"through":[44,67],"particular":[46],"distribution":[47,72,83],"An":[56],"expression":[57],"for":[58,63,86],"travel":[62],"\u201cparticular\u201d":[69],"class":[70],"obtained.":[81],"which":[87],"method":[89],"valid":[91],"characterized":[93],"terms":[95],"family":[98],"parabolas":[100],"plane.":[103]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}