{"id":"https://openalex.org/W2099928371","doi":"https://doi.org/10.1109/robio.2009.5420404","title":"Virtual Sphere Algorithms for orthodrome-based collision-free & smooth robot motion","display_name":"Virtual Sphere Algorithms for orthodrome-based collision-free & smooth robot motion","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2099928371","doi":"https://doi.org/10.1109/robio.2009.5420404","mag":"2099928371"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2009.5420404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2009.5420404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Biomimetics (ROBIO)","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/A5062650274","display_name":"Anand TM","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anand TM","raw_affiliation_strings":["College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","College of Computing, Georgia Institute of Technology, Atlanta, GA 30332 USA"],"affiliations":[{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, GA 30332 USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062650274"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13199115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1530","last_page":"1536"},"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.9980000257492065,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9977999925613403,"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/obstacle","display_name":"Obstacle","score":0.6500771045684814},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6025677919387817},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5603553056716919},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5406666994094849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5253093838691711},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4954601526260376},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48527976870536804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47265613079071045},{"id":"https://openalex.org/keywords/great-circle","display_name":"Great circle","score":0.4585771858692169},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4452621638774872},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3564322590827942},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.3171362280845642},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3164352774620056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30471551418304443},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.22075212001800537},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1664295792579651},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12227484583854675},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09208813309669495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08941012620925903}],"concepts":[{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6500771045684814},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6025677919387817},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5603553056716919},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5406666994094849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5253093838691711},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4954601526260376},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48527976870536804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47265613079071045},{"id":"https://openalex.org/C148189969","wikidata":"https://www.wikidata.org/wiki/Q146657","display_name":"Great circle","level":2,"score":0.4585771858692169},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4452621638774872},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3564322590827942},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3171362280845642},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3164352774620056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30471551418304443},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22075212001800537},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1664295792579651},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12227484583854675},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09208813309669495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08941012620925903},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robio.2009.5420404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2009.5420404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W131069610","https://openalex.org/W843432513","https://openalex.org/W1424654272","https://openalex.org/W1496777766","https://openalex.org/W1523827670","https://openalex.org/W1869703597","https://openalex.org/W1904799423","https://openalex.org/W1939218045","https://openalex.org/W1969483458","https://openalex.org/W2015751084","https://openalex.org/W2053407718","https://openalex.org/W2069830673","https://openalex.org/W2096729038","https://openalex.org/W2098508993","https://openalex.org/W2098519927","https://openalex.org/W2103120971","https://openalex.org/W2113286054","https://openalex.org/W2114216009","https://openalex.org/W2123272733","https://openalex.org/W2125409550","https://openalex.org/W2126548517","https://openalex.org/W2128990851","https://openalex.org/W2129601601","https://openalex.org/W2153612202","https://openalex.org/W2163852435","https://openalex.org/W2177274602","https://openalex.org/W2611243847","https://openalex.org/W4236092128","https://openalex.org/W4242811155","https://openalex.org/W4285719527","https://openalex.org/W6605295560","https://openalex.org/W6639902923","https://openalex.org/W6675683402"],"related_works":["https://openalex.org/W4388726836","https://openalex.org/W4380590094","https://openalex.org/W2050548713","https://openalex.org/W2154722715","https://openalex.org/W3119736302","https://openalex.org/W2153809277","https://openalex.org/W3200041777","https://openalex.org/W2015961810","https://openalex.org/W4386464271","https://openalex.org/W2956606787"],"abstract_inverted_index":{"A":[0,97],"novel":[1],"geometric":[2,144],"algorithm":[3,25,70],"is":[4,104],"proposed":[5],"that":[6,119],"assures":[7],"a":[8,16,34,40,74,132],"smooth":[9],"path":[10,53,61,150],"around":[11,19,94],"the":[12,28,44,49,51,55,58,63,79,82,87,95,110,116,137,143],"obstacle":[13,59,83,134],"by":[14,107],"generating":[15],"virtual":[17,23,64,68,75,126],"sphere":[18,24,69,76,127],"it.":[20],"The":[21,66],"spherical":[22,138],"(SVSA)":[26],"makes":[27,86],"end-effector":[29,88],"(the":[30],"outermost":[31],"tip":[32],"of":[33,43,57,81,100,115,148,154],"closed":[35],"gripper":[36],"and":[37,146],"hence,":[38],"considered":[39],"point":[41],"object)":[42],"robot":[45],"manipulator":[46],"navigate":[47,89],"along":[48,90],"orthodrome,":[50],"shortest":[52,149],"connecting":[54],"end-points":[56,80],"avoidance":[60,84],"on":[62,121],"sphere.":[65],"exponential":[67,92],"(EVSA),":[71],"although":[72],"uses":[73],"to":[77,136,142],"determine":[78],"path,":[85],"an":[91],"curve":[93],"obstacle.":[96],"performance":[98],"comparison":[99],"both":[101],"these":[102],"algorithms":[103,118,128],"presented,":[105],"followed":[106],"achievements":[108,153],"over":[109],"past":[111],"algorithms.":[112],"Unlike":[113],"some":[114],"existing":[117],"focus":[120],"recovering":[122],"from":[123],"local":[124],"minima,":[125],"(VSAs)":[129],"avoid":[130],"entering":[131],"concave":[133],"due":[135,141],"encapsulation.":[139],"Simplicity":[140],"nature":[145],"guarantee":[147],"are":[151],"major":[152],"VSAs.":[155]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}