{"id":"https://openalex.org/W2807555322","doi":"https://doi.org/10.1007/s13177-018-0159-5","title":"On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle","display_name":"On Designing Near-Optimum Paths on Weighted Regions for an Intelligent Vehicle","publication_year":2018,"publication_date":"2018-06-04","ids":{"openalex":"https://openalex.org/W2807555322","doi":"https://doi.org/10.1007/s13177-018-0159-5","mag":"2807555322"},"language":"en","primary_location":{"id":"doi:10.1007/s13177-018-0159-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s13177-018-0159-5","pdf_url":null,"source":{"id":"https://openalex.org/S118678737","display_name":"International Journal of Intelligent Transportation Systems Research","issn_l":"1348-8503","issn":["1348-8503","1868-8659"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Transportation Systems Research","raw_type":"journal-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/A5052208676","display_name":"Elias K. Xidias","orcid":"https://orcid.org/0000-0002-6228-4577"},"institutions":[{"id":"https://openalex.org/I98805295","display_name":"University of the Aegean","ror":"https://ror.org/03zsp3p94","country_code":"GR","type":"education","lineage":["https://openalex.org/I98805295"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Elias K. Xidias","raw_affiliation_strings":["Department of Product & Systems Design Engineering, University of the Aegean, Syros, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Product & Systems Design Engineering, University of the Aegean, Syros, Greece","institution_ids":["https://openalex.org/I98805295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052208676"],"corresponding_institution_ids":["https://openalex.org/I98805295"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.6374,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74071153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"2","first_page":"89","last_page":"101"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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/set","display_name":"Set (abstract data type)","score":0.6346193552017212},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6233242750167847},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6024702787399292},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6007685661315918},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.45388397574424744},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.4263456165790558},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4185780882835388},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4121472239494324},{"id":"https://openalex.org/keywords/depot","display_name":"Depot","score":0.4115944504737854},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.38032081723213196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3211418390274048},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14808976650238037},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10382348299026489},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08987385034561157}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6346193552017212},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6233242750167847},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6024702787399292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007685661315918},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.45388397574424744},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.4263456165790558},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4185780882835388},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4121472239494324},{"id":"https://openalex.org/C2776561332","wikidata":"https://www.wikidata.org/wiki/Q5554853","display_name":"Depot","level":2,"score":0.4115944504737854},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.38032081723213196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3211418390274048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14808976650238037},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10382348299026489},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08987385034561157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s13177-018-0159-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s13177-018-0159-5","pdf_url":null,"source":{"id":"https://openalex.org/S118678737","display_name":"International Journal of Intelligent Transportation Systems Research","issn_l":"1348-8503","issn":["1348-8503","1868-8659"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Transportation Systems Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1548879090","https://openalex.org/W1601944652","https://openalex.org/W1987103011","https://openalex.org/W1989723858","https://openalex.org/W1995284651","https://openalex.org/W2000398849","https://openalex.org/W2028769163","https://openalex.org/W2049478624","https://openalex.org/W2051626883","https://openalex.org/W2056389984","https://openalex.org/W2062152496","https://openalex.org/W2086036807","https://openalex.org/W2093665022","https://openalex.org/W2094360223","https://openalex.org/W2096305430","https://openalex.org/W2101679459","https://openalex.org/W2128990851","https://openalex.org/W2140153029","https://openalex.org/W2145493798","https://openalex.org/W2207793232","https://openalex.org/W2611243847","https://openalex.org/W3023540311","https://openalex.org/W4205649593"],"related_works":["https://openalex.org/W2395000508","https://openalex.org/W2420434559","https://openalex.org/W3192142172","https://openalex.org/W2028669302","https://openalex.org/W1553143911","https://openalex.org/W2093799795","https://openalex.org/W2417634612","https://openalex.org/W2371664621","https://openalex.org/W2735372451","https://openalex.org/W3134266419"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}