{"id":"https://openalex.org/W2137411077","doi":"https://doi.org/10.1109/jra.1987.1087080","title":"Robot path planning using intersecting convex shapes: Analysis and simulation","display_name":"Robot path planning using intersecting convex shapes: Analysis and simulation","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2137411077","doi":"https://doi.org/10.1109/jra.1987.1087080","mag":"2137411077"},"language":"en","primary_location":{"id":"doi:10.1109/jra.1987.1087080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jra.1987.1087080","pdf_url":null,"source":{"id":"https://openalex.org/S105799543","display_name":"IEEE Journal on Robotics and Automation","issn_l":"0882-4967","issn":["0882-4967","2374-8710"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Robotics and Automation","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/A5100679539","display_name":"Jitendra Kumar Singh","orcid":"https://orcid.org/0000-0002-8006-4076"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Singh","raw_affiliation_strings":["Construction Robotics Laboratory, Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Construction Robotics Laboratory, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114181411","display_name":"M. Wagh","orcid":null},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Wagh","raw_affiliation_strings":["Department of Computer Science and Electrical Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.514,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.9486336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"2","first_page":"101","last_page":"108"},"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.9909999966621399,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/tree-traversal","display_name":"Tree traversal","score":0.6664503216743469},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5967156887054443},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5591877698898315},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5422237515449524},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5238533020019531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4992861747741699},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4886322617530823},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4832821190357208},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4769688546657562},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45633572340011597},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4312138855457306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35554805397987366},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3539128005504608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33043429255485535},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22113707661628723}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6664503216743469},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5967156887054443},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5591877698898315},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5422237515449524},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5238533020019531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4992861747741699},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4886322617530823},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4832821190357208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4769688546657562},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45633572340011597},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4312138855457306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35554805397987366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3539128005504608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33043429255485535},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22113707661628723},{"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.1109/jra.1987.1087080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jra.1987.1087080","pdf_url":null,"source":{"id":"https://openalex.org/S105799543","display_name":"IEEE Journal on Robotics and Automation","issn_l":"0882-4967","issn":["0882-4967","2374-8710"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Robotics and Automation","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.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W65703446","https://openalex.org/W73939577","https://openalex.org/W1554451661","https://openalex.org/W1602132814","https://openalex.org/W2014320134","https://openalex.org/W2018094844","https://openalex.org/W2024403195","https://openalex.org/W2052258220","https://openalex.org/W2099034771","https://openalex.org/W2117123327","https://openalex.org/W2163178194","https://openalex.org/W2329329248","https://openalex.org/W2335478831","https://openalex.org/W4231510479","https://openalex.org/W4253456425","https://openalex.org/W6602927190"],"related_works":["https://openalex.org/W244044452","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W1539483014","https://openalex.org/W2285629142","https://openalex.org/W2524096652","https://openalex.org/W4312825863","https://openalex.org/W2248741517","https://openalex.org/W1571859106","https://openalex.org/W3211031828"],"abstract_inverted_index":{"An":[0,15],"automated":[1],"path":[2],"planning":[3],"algorithm":[4,16,73],"for":[5,80],"a":[6,10,27,42,54,57,75],"mobile":[7],"robot":[8],"in":[9,26,41,53],"structured":[11],"environment":[12],"is":[13,30,68],"presented.":[14],"based":[17],"on":[18],"the":[19,35,72],"Quine-McCluskey":[20],"method":[21],"of":[22,71],"finding":[23],"prime":[24],"implicants":[25],"logical":[28],"expression":[29],"used":[31],"to":[32,65,77],"isolate":[33],"all":[34],"largest":[36],"rectangular":[37],"free":[38,46],"convex":[39,47],"areas":[40,48],"specified":[43],"environment.":[44],"The":[45],"are":[49,84],"represented":[50],"as":[51],"nodes":[52],"graph,":[55],"and":[56,74],"graph":[58,66],"traversal":[59],"strategy":[60,76],"that":[61],"dynamically":[62],"allocates":[63],"costs":[64],"paths":[67],"used.":[69],"Complexity":[70],"trade":[78],"optimality":[79],"smaller":[81],"computation":[82],"time":[83],"discussed.":[85]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}