{"id":"https://openalex.org/W4380901158","doi":"https://doi.org/10.1007/978-3-031-35308-6_10","title":"Deep Learning Based Path-Planning Using CRNN and A* for Mobile Robots","display_name":"Deep Learning Based Path-Planning Using CRNN and A* for Mobile Robots","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4380901158","doi":"https://doi.org/10.1007/978-3-031-35308-6_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-35308-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-35308-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S4210169156","display_name":"Lecture notes in networks and systems","issn_l":"2367-3370","issn":["2367-3370","2367-3389"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319972","host_organization_name":"Springer International Publishing","host_organization_lineage":["https://openalex.org/P4310319972","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer International Publishing","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Networks and Systems","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/A5090479586","display_name":"Muhammad Aatif","orcid":"https://orcid.org/0000-0003-1924-784X"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Muhammad Aatif","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010212674","display_name":"Umar Adeel","orcid":"https://orcid.org/0000-0002-1779-4877"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Umar Adeel","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061326683","display_name":"Amin Basiri","orcid":"https://orcid.org/0000-0001-9870-4441"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Amin Basiri","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040270116","display_name":"Valerio Mariani","orcid":"https://orcid.org/0000-0003-2284-3802"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Valerio Mariani","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050499082","display_name":"Luigi Iannelli","orcid":"https://orcid.org/0000-0003-2034-0005"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luigi Iannelli","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011562075","display_name":"Luigi Glielmo","orcid":"https://orcid.org/0000-0003-2753-1787"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luigi Glielmo","raw_affiliation_strings":["University of Sannio, Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"University of Sannio, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5090479586"],"corresponding_institution_ids":["https://openalex.org/I16337185"],"apc_list":null,"apc_paid":null,"fwci":1.6227,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.88447329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"128"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7117430567741394},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6477381587028503},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6448541879653931},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6054685115814209},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5869615077972412},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46047794818878174},{"id":"https://openalex.org/keywords/recurrent-neural-network","display_name":"Recurrent neural network","score":0.4468473196029663},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.43740877509117126},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42474493384361267},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.38460761308670044},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3447376787662506},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.34182363748550415},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1619623899459839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1132640540599823},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06346353888511658}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7117430567741394},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6477381587028503},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6448541879653931},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6054685115814209},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5869615077972412},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46047794818878174},{"id":"https://openalex.org/C147168706","wikidata":"https://www.wikidata.org/wiki/Q1457734","display_name":"Recurrent neural network","level":3,"score":0.4468473196029663},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.43740877509117126},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42474493384361267},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.38460761308670044},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3447376787662506},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.34182363748550415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1619623899459839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1132640540599823},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06346353888511658},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-35308-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-35308-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S4210169156","display_name":"Lecture notes in networks and systems","issn_l":"2367-3370","issn":["2367-3370","2367-3389"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319972","host_organization_name":"Springer International Publishing","host_organization_lineage":["https://openalex.org/P4310319972","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer International Publishing","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Networks and Systems","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1499825025","https://openalex.org/W1969483458","https://openalex.org/W2083455089","https://openalex.org/W2087064593","https://openalex.org/W2089314366","https://openalex.org/W2135197516","https://openalex.org/W2210721416","https://openalex.org/W2227909145","https://openalex.org/W2329739548","https://openalex.org/W2593828410","https://openalex.org/W2739435704","https://openalex.org/W2963409832","https://openalex.org/W2964568892","https://openalex.org/W2967969632","https://openalex.org/W3021208093","https://openalex.org/W3091091967"],"related_works":["https://openalex.org/W804484174","https://openalex.org/W1568779110","https://openalex.org/W4244698559","https://openalex.org/W4246538999","https://openalex.org/W2002361198","https://openalex.org/W56933075","https://openalex.org/W2168364913","https://openalex.org/W1548568597","https://openalex.org/W2482749251","https://openalex.org/W3008584592"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4}],"updated_date":"2026-01-25T23:04:38.658462","created_date":"2025-10-10T00:00:00"}