{"id":"https://openalex.org/W1605032457","doi":"https://doi.org/10.1109/romoco.2015.7219738","title":"Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm","display_name":"Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W1605032457","doi":"https://doi.org/10.1109/romoco.2015.7219738","mag":"1605032457"},"language":"en","primary_location":{"id":"doi:10.1109/romoco.2015.7219738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/romoco.2015.7219738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 10th International Workshop on Robot Motion and Control (RoMoCo)","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/A5076956727","display_name":"Adam Niewola","orcid":"https://orcid.org/0000-0002-6715-4333"},"institutions":[{"id":"https://openalex.org/I34250744","display_name":"University of \u0141\u00f3d\u017a","ror":"https://ror.org/05cq64r17","country_code":"PL","type":"education","lineage":["https://openalex.org/I34250744"]},{"id":"https://openalex.org/I188884621","display_name":"Lodz University of Technology","ror":"https://ror.org/00s8fpf52","country_code":"PL","type":"education","lineage":["https://openalex.org/I188884621"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Adam Niewola","raw_affiliation_strings":["Technical University of Lodz, Institute of Machine Tools and Production Engineering","Technical University of Lodz, Institute of Machine Tools and Production Engineering, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University of Lodz, Institute of Machine Tools and Production Engineering","institution_ids":["https://openalex.org/I188884621"]},{"raw_affiliation_string":"Technical University of Lodz, Institute of Machine Tools and Production Engineering, Poland","institution_ids":["https://openalex.org/I34250744"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083488483","display_name":"Leszek Pods\u0119dkowski","orcid":"https://orcid.org/0000-0003-2315-3109"},"institutions":[{"id":"https://openalex.org/I34250744","display_name":"University of \u0141\u00f3d\u017a","ror":"https://ror.org/05cq64r17","country_code":"PL","type":"education","lineage":["https://openalex.org/I34250744"]},{"id":"https://openalex.org/I188884621","display_name":"Lodz University of Technology","ror":"https://ror.org/00s8fpf52","country_code":"PL","type":"education","lineage":["https://openalex.org/I188884621"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Leszek Podsedkowski","raw_affiliation_strings":["Technical University of Lodz, Institute of Machine Tools and Production Engineering","Technical University of Lodz, Institute of Machine Tools and Production Engineering, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University of Lodz, Institute of Machine Tools and Production Engineering","institution_ids":["https://openalex.org/I188884621"]},{"raw_affiliation_string":"Technical University of Lodz, Institute of Machine Tools and Production Engineering, Poland","institution_ids":["https://openalex.org/I34250744"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076956727"],"corresponding_institution_ids":["https://openalex.org/I188884621","https://openalex.org/I34250744"],"apc_list":null,"apc_paid":null,"fwci":0.3682,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6649191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"39","issue":null,"first_page":"217","last_page":"222"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7294529676437378},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6533550024032593},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5607640743255615},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5599666833877563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5493700504302979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5335291624069214},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.48209670186042786},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.4820578992366791},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4494931697845459},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4461647868156433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4394165575504303},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4246899485588074},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.30204033851623535},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.24999186396598816},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2442168891429901}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7294529676437378},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6533550024032593},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5607640743255615},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5599666833877563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5493700504302979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5335291624069214},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.48209670186042786},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.4820578992366791},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4494931697845459},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4461647868156433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4394165575504303},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4246899485588074},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.30204033851623535},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.24999186396598816},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2442168891429901},{"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.1109/romoco.2015.7219738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/romoco.2015.7219738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 10th International Workshop on Robot Motion and Control (RoMoCo)","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":17,"referenced_works":["https://openalex.org/W944780081","https://openalex.org/W1600618345","https://openalex.org/W1935926926","https://openalex.org/W1982809790","https://openalex.org/W2066426639","https://openalex.org/W2085917651","https://openalex.org/W2099144379","https://openalex.org/W2129969688","https://openalex.org/W2130222542","https://openalex.org/W2294319407","https://openalex.org/W2348623805","https://openalex.org/W2561843528","https://openalex.org/W3103759471","https://openalex.org/W4236251699","https://openalex.org/W4242811155","https://openalex.org/W6624725602","https://openalex.org/W6636001420"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":{"The":[0],"A*":[1,26,60],"algorithm":[2,27,63],"and":[3,64],"its":[4],"modifications":[5],"are":[6],"commonly":[7],"used":[8],"in":[9,18,84,96],"graph":[10,61,98],"searching":[11,62,99],"for":[12,91],"mobile":[13],"robot":[14],"path":[15],"planning.":[16],"However":[17],"case":[19],"of":[20,47,73],"large":[21,92],"open":[22,38,75,93],"list":[23,39,76,94],"sizes":[24,95],"the":[25,33,37,44,59,71,74,88],"needs":[28],"significant":[29],"time":[30,89],"to":[31,36,70,86],"find":[32],"solution":[34],"due":[35,69],"sorting":[40,77],"procedure":[41],"which":[42,57],"determines":[43],"computational":[45,67],"complexity":[46,68],"A*.":[48],"This":[49,79],"paper":[50],"presents":[51],"a":[52,81,97],"new":[53],"approach":[54],"called":[55],"L*":[56],"improves":[58],"provides":[65],"linear":[66],"lack":[72],"procedure.":[78],"is":[80],"crucial":[82],"factor":[83],"order":[85],"decrease":[87],"consumption":[90],"algorithm.":[100]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}