{"id":"https://openalex.org/W2079954160","doi":"https://doi.org/10.1163/156855393x00267","title":"A sufficient condition for designing a family of sensor-based deadlock-free path-planning algorithms","display_name":"A sufficient condition for designing a family of sensor-based deadlock-free path-planning algorithms","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2079954160","doi":"https://doi.org/10.1163/156855393x00267","mag":"2079954160"},"language":"en","primary_location":{"id":"doi:10.1163/156855393x00267","is_oa":false,"landing_page_url":"https://doi.org/10.1163/156855393x00267","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","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/A5113820090","display_name":"Hiroshi Noborio","orcid":null},"institutions":[{"id":"https://openalex.org/I189513530","display_name":"Osaka Electro-Communication University","ror":"https://ror.org/056bksm23","country_code":"JP","type":"education","lineage":["https://openalex.org/I189513530"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroshi Noborio","raw_affiliation_strings":["a    Department of Precision Engineering, Faculty of Engineering, Osaka Electro-Communication University, Hatsu-Cho 18-8, Neyagawa, Osaka 572, Japan","a Department of Precision Engineering, Faculty of Engineering, Osaka Electro-Communication University, Hatsu-Cho 18-8, Neyagawa, Osaka 572, Japan"],"affiliations":[{"raw_affiliation_string":"a    Department of Precision Engineering, Faculty of Engineering, Osaka Electro-Communication University, Hatsu-Cho 18-8, Neyagawa, Osaka 572, Japan","institution_ids":["https://openalex.org/I189513530"]},{"raw_affiliation_string":"a Department of Precision Engineering, Faculty of Engineering, Osaka Electro-Communication University, Hatsu-Cho 18-8, Neyagawa, Osaka 572, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113820090"],"corresponding_institution_ids":["https://openalex.org/I189513530"],"apc_list":null,"apc_paid":null,"fwci":1.0782,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.79917913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"5","first_page":"413","last_page":"433"},"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.9991000294685364,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/obstacle","display_name":"Obstacle","score":0.7240105271339417},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6775825023651123},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6327040195465088},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6074230670928955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5132720470428467},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5013165473937988},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4897063076496124},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.44642284512519836},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4123249650001526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32273006439208984},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24497246742248535},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.18958082795143127},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1802152395248413},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07178688049316406}],"concepts":[{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7240105271339417},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6775825023651123},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6327040195465088},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6074230670928955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5132720470428467},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5013165473937988},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4897063076496124},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.44642284512519836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4123249650001526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32273006439208984},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24497246742248535},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18958082795143127},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1802152395248413},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07178688049316406},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1163/156855393x00267","is_oa":false,"landing_page_url":"https://doi.org/10.1163/156855393x00267","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1602132814","https://openalex.org/W1925038472","https://openalex.org/W2024403195","https://openalex.org/W2090170700","https://openalex.org/W2103120971","https://openalex.org/W2114302864","https://openalex.org/W2119559506","https://openalex.org/W2163178194","https://openalex.org/W2476374484","https://openalex.org/W3164191559"],"related_works":["https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W2005328770","https://openalex.org/W2040844343","https://openalex.org/W2980590076","https://openalex.org/W4243666448","https://openalex.org/W1526546163","https://openalex.org/W4252628394","https://openalex.org/W1533908838","https://openalex.org/W1924007886"],"abstract_inverted_index":{"An":[0],"intelligent":[1],"automaton":[2,21,81,118,153,162,204,235,267,300,321,336],"should":[3],"always":[4,268],"arrive":[5,121],"at":[6,122,125,323],"its":[7,39,211],"goal":[8,124,194,216,254,273,339],"automatically":[9],"while":[10],"avoiding":[11],"the":[12,20,25,33,47,52,66,74,80,84,88,91,101,104,108,111,117,123,152,158,161,173,178,193,197,203,208,215,229,234,237,243,249,253,257,264,266,272,282,286,293,295,299,310,320,324,329,332,335,338],"obstacles":[13,86,102],"in":[14,32,73,103,145,183,281,305,340],"a":[15,58,133,138,165,187,220,327],"two-dimensional":[16],"(2D)":[17],"world.":[18,148,283,344],"If":[19,114,160],"does":[22,119,276],"not":[23,120,277],"know":[24],"shape":[26],"or":[27],"location":[28],"of":[29,90,100,107,110,140,248,316,334],"any":[30,279],"obstacle":[31,171,179,209,238,280,304],"world,":[34],"it":[35,50,95,176,185,275],"gathers":[36],"information":[37,93],"on":[38,87],"neighbourhood":[40],"from":[41],"some":[42,99,303],"sensor,":[43,175],"and":[44,182,318],"according":[45,70],"to":[46,64,71,157,189,192,206,214,239,242,252,271,292,337],"sensor":[48,75,112],"information,":[49],"avoids":[51,83],"closer":[53,85],"obstacles.":[54],"In":[55,263],"this":[56,78,129,150],"situation,":[57],"sensor-based":[59,142],"path-planning":[60,143],"algorithm":[61,258],"is":[62,217,224,228],"used":[63],"determine":[65],"automaton's":[67],"action":[68],"flexibly":[69],"changes":[72],"information.":[76,113],"By":[77],"method,":[79],"usually":[82],"basis":[89],"local":[92],"but":[94],"may":[96],"circulate":[97],"around":[98,196],"world":[105],"because":[106],"locality":[109],"deadlock":[115],"occurs,":[116],"all.":[126],"To":[127],"overcome":[128],"drawback,":[130],"we":[131],"address":[132],"sufficient":[134,230],"condition":[135],"for":[136],"designing":[137],"family":[139,259,330],"deadlock-free":[141],"algorithms":[144],"an":[146,169,341],"uncertain":[147,342],"Within":[149],"family,":[151,265],"basically":[154],"goes":[155,269,314],"straight":[156,191,241,270],"goal.":[159,244,325],"occasionally":[163],"finds":[164,186],"hit":[166,302],"point":[167,251,288],"against":[168],"unfamiliar":[170],"via":[172],"touch":[174,181],"traces":[177],"by":[180],"time":[184],"way":[188],"go":[190,240],"again":[195],"obstacle.":[198],"Even":[199],"under":[200,232],"those":[201],"conditions":[202],"continues":[205],"trace":[207,278],"until":[210],"Euclidean":[212],"distance":[213,221],"smaller":[218],"than":[219],"index":[222],"which":[223,233],"decreasing":[225],"asymptotically.":[226,308],"This":[227,245],"condition,":[231],"leaves":[236],"asymptotical":[246],"approach":[247],"leave":[250,287],"guarantees":[255],"that":[256],"will":[260],"be":[261],"deadlock-free.":[262],"if":[274,285],"Thus,":[284],"comes":[289],"asymptotically":[290],"close":[291],"goal,":[294],"circular":[296,311],"space":[297,312],"where":[298],"can":[301],"future":[306],"decreases":[307],"Therefore":[309],"finally":[313],"out":[315],"existence":[317],"consequently":[319],"arrives":[322],"As":[326],"result,":[328],"ensures":[331],"convergence":[333],"2D":[343]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}