{"id":"https://openalex.org/W1495104209","doi":"https://doi.org/10.1007/978-3-540-48765-4_23","title":"An Improvised A Algorithm for Mobile Robots to Find the Optimal Path in an Unknown Environment with Minimized Search Efforts","display_name":"An Improvised A Algorithm for Mobile Robots to Find the Optimal Path in an Unknown Environment with Minimized Search Efforts","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1495104209","doi":"https://doi.org/10.1007/978-3-540-48765-4_23","mag":"1495104209"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-48765-4_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-48765-4_23","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5046031344","display_name":"D.A.L. Piriyakumar","orcid":"https://orcid.org/0000-0002-4303-8573"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Douglas Antony Louis Piriyakumar","raw_affiliation_strings":["Institute of Parallel and Distributed High-Performance Systems, University of Stuttgart, 70565, Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Parallel and Distributed High-Performance Systems, University of Stuttgart, 70565, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111539971","display_name":"Paul Levi","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Paul Levi","raw_affiliation_strings":["Institute of Parallel and Distributed High-Performance Systems, University of Stuttgart, 70565, Stuttgart, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Parallel and Distributed High-Performance Systems, University of Stuttgart, 70565, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1055409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"195","last_page":"204"},"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.9973999857902527,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/traverse","display_name":"Traverse","score":0.7774749398231506},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.754456102848053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7063164710998535},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.625531017780304},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6011177897453308},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5954509973526001},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.5178704261779785},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5044375658035278},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.501021146774292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4850739538669586},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.46932145953178406},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4676487147808075},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45517638325691223},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4494478702545166},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4298902451992035},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4110623896121979},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22040387988090515},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17449790239334106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16478243470191956},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.1516927182674408},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.14608296751976013}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7774749398231506},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.754456102848053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7063164710998535},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.625531017780304},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6011177897453308},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5954509973526001},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.5178704261779785},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5044375658035278},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.501021146774292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4850739538669586},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.46932145953178406},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4676487147808075},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45517638325691223},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4494478702545166},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4298902451992035},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4110623896121979},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22040387988090515},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17449790239334106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16478243470191956},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.1516927182674408},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.14608296751976013},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-48765-4_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-48765-4_23","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1556081780","https://openalex.org/W1646038686","https://openalex.org/W2009796613","https://openalex.org/W2014234623","https://openalex.org/W2028145673","https://openalex.org/W2051626883","https://openalex.org/W2099144379","https://openalex.org/W2102248503","https://openalex.org/W2119250866","https://openalex.org/W2128990851","https://openalex.org/W2130618585","https://openalex.org/W2133647978","https://openalex.org/W2143576344","https://openalex.org/W2145778183","https://openalex.org/W2152053668","https://openalex.org/W2152475379","https://openalex.org/W2319958627","https://openalex.org/W2321292752","https://openalex.org/W2571678918","https://openalex.org/W4236251699","https://openalex.org/W4242811155"],"related_works":["https://openalex.org/W2885402535","https://openalex.org/W2747118187","https://openalex.org/W2376570066","https://openalex.org/W1622225657","https://openalex.org/W2578195970","https://openalex.org/W2402589461","https://openalex.org/W2354057059","https://openalex.org/W2152622186","https://openalex.org/W2940367488","https://openalex.org/W3211459648"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}