{"id":"https://openalex.org/W2069830000","doi":"https://doi.org/10.1017/s0263574798000289","title":"Path planning of a mobile robot using genetic heuristics","display_name":"Path planning of a mobile robot using genetic heuristics","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2069830000","doi":"https://doi.org/10.1017/s0263574798000289","mag":"2069830000"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574798000289","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574798000289","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","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/A5090324318","display_name":"Andreas C. Nearchou","orcid":"https://orcid.org/0000-0002-5525-8661"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Andreas C. Nearchou","raw_affiliation_strings":["Mechanical Engineering Department, University of Patras, 26 110 Patras, Greece. E-mail:","Mechanical Engineering Department, University of Patras, 26 110 Patras, Greece. E-mail: nearchou@upatras.gr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, University of Patras, 26 110 Patras, Greece. E-mail:","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Mechanical Engineering Department, University of Patras, 26 110 Patras, Greece. E-mail: nearchou@upatras.gr#TAB#","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090324318"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.1672602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"5","first_page":"575","last_page":"588"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9961000084877014,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/motion-planning","display_name":"Motion planning","score":0.7311697602272034},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7288219928741455},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6239608526229858},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6182072758674622},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6091066598892212},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5773227214813232},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48971107602119446},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48122406005859375},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.47887176275253296},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4774742126464844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46469494700431824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44888415932655334},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4290342926979065},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3464512526988983},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2911062240600586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23186331987380981},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13932856917381287}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7311697602272034},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7288219928741455},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6239608526229858},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6182072758674622},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6091066598892212},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5773227214813232},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48971107602119446},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48122406005859375},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.47887176275253296},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4774742126464844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46469494700431824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44888415932655334},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4290342926979065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3464512526988983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2911062240600586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23186331987380981},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13932856917381287},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574798000289","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574798000289","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1497256448","https://openalex.org/W1827984144","https://openalex.org/W1965440866","https://openalex.org/W1969483458","https://openalex.org/W2010692862","https://openalex.org/W2011890292","https://openalex.org/W2018579798","https://openalex.org/W2028569720","https://openalex.org/W2085789363","https://openalex.org/W2144717132","https://openalex.org/W2150500908","https://openalex.org/W2151676833","https://openalex.org/W2156728410","https://openalex.org/W2169528473","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W1232705","https://openalex.org/W2460653416","https://openalex.org/W2084470113","https://openalex.org/W2053571861","https://openalex.org/W2022341304","https://openalex.org/W1965569281","https://openalex.org/W2546046681","https://openalex.org/W4211249017","https://openalex.org/W2138041878","https://openalex.org/W2368795992"],"abstract_inverted_index":{"A":[0],"genetic":[1,63,92],"algorithm":[2,33,64],"for":[3,90],"the":[4,31,55,61,91],"path":[5,37,57],"planning":[6,58],"problem":[7,27,59],"of":[8,43,50,54],"a":[9,25,29,35,40,82],"mobile":[10],"robot":[11],"which":[12],"is":[13,22],"moving":[14],"and":[15,77],"picking":[16],"up":[17],"loads":[18],"on":[19],"its":[20],"way":[21],"presented.":[23],"Assuming":[24],"findpath":[26],"in":[28],"graph,":[30],"proposed":[32,62],"determines":[34],"near-optimal":[36],"solution":[38],"using":[39,60],"bit-string":[41],"encoding":[42],"selected":[44],"graph":[45],"vertices.":[46],"Several":[47],"simulation":[48],"results":[49,68],"specific":[51],"task-oriented":[52],"variants":[53],"basic":[56],"are":[65,70],"provided.":[66],"The":[67],"obtained":[69],"compared":[71],"with":[72],"ones":[73],"yielded":[74],"by":[75],"hill-climbing":[76],"simulated":[78],"annealing":[79],"techniques,":[80],"showing":[81],"higher":[83],"or":[84],"at":[85],"least":[86],"equally":[87],"well":[88],"performance":[89],"algorithm.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}