{"id":"https://openalex.org/W2982486675","doi":"https://doi.org/10.1109/cccs.2019.8888083","title":"Reducing Traverse Space in Path Planning using Snake Model for Robots","display_name":"Reducing Traverse Space in Path Planning using Snake Model for Robots","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2982486675","doi":"https://doi.org/10.1109/cccs.2019.8888083","mag":"2982486675"},"language":"en","primary_location":{"id":"doi:10.1109/cccs.2019.8888083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cccs.2019.8888083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","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/A5069030967","display_name":"Kaushlendra Sharma","orcid":"https://orcid.org/0000-0002-9140-5788"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kaushlendra Sharma","raw_affiliation_strings":["Department of Information Technology, National Institute of Technology Raipur, Raipur, India"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, National Institute of Technology Raipur, Raipur, India","institution_ids":["https://openalex.org/I38335241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050941143","display_name":"Rajesh Doriya","orcid":"https://orcid.org/0000-0001-6375-4940"},"institutions":[{"id":"https://openalex.org/I38335241","display_name":"National Institute of Technology Raipur","ror":"https://ror.org/02y553197","country_code":"IN","type":"education","lineage":["https://openalex.org/I38335241"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajesh Doriya","raw_affiliation_strings":["Department of Information Technology, National Institute of Technology Raipur, Raipur, India"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, National Institute of Technology Raipur, Raipur, India","institution_ids":["https://openalex.org/I38335241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069030967"],"corresponding_institution_ids":["https://openalex.org/I38335241"],"apc_list":null,"apc_paid":null,"fwci":0.5061,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69770302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9725000262260437,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9366999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.9044866561889648},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8484716415405273},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7971181869506836},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.783593475818634},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7584718465805054},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.7522861957550049},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6206081509590149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5602819919586182},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5579276084899902},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5266328454017639},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.49351656436920166},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4833599925041199},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47530943155288696},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4306848645210266},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4075871407985687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2306094467639923},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07391652464866638}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.9044866561889648},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8484716415405273},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7971181869506836},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.783593475818634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7584718465805054},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.7522861957550049},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6206081509590149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5602819919586182},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5579276084899902},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5266328454017639},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.49351656436920166},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4833599925041199},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47530943155288696},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4306848645210266},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4075871407985687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2306094467639923},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07391652464866638},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cccs.2019.8888083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cccs.2019.8888083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W7361405","https://openalex.org/W131069610","https://openalex.org/W362117023","https://openalex.org/W630506841","https://openalex.org/W1500313741","https://openalex.org/W1501995149","https://openalex.org/W1505554756","https://openalex.org/W1532217327","https://openalex.org/W1944903321","https://openalex.org/W1988224867","https://openalex.org/W1995831026","https://openalex.org/W2000359213","https://openalex.org/W2013385611","https://openalex.org/W2017436536","https://openalex.org/W2019738489","https://openalex.org/W2031963682","https://openalex.org/W2061438946","https://openalex.org/W2100084738","https://openalex.org/W2104095591","https://openalex.org/W2122410182","https://openalex.org/W2131871663","https://openalex.org/W2145602088","https://openalex.org/W2159524963","https://openalex.org/W2293272334","https://openalex.org/W2483623783","https://openalex.org/W2498991536","https://openalex.org/W2515498963","https://openalex.org/W2626934423","https://openalex.org/W2766096980","https://openalex.org/W2772821814","https://openalex.org/W2883180136","https://openalex.org/W2885205665","https://openalex.org/W2904918018","https://openalex.org/W2921410781","https://openalex.org/W4233783029","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2248868695","https://openalex.org/W3049455165","https://openalex.org/W3034726893","https://openalex.org/W2990979393","https://openalex.org/W3208716311","https://openalex.org/W2921656333","https://openalex.org/W2892076060","https://openalex.org/W2950326329","https://openalex.org/W3012164143","https://openalex.org/W3195471665","https://openalex.org/W2316378294","https://openalex.org/W3204444418","https://openalex.org/W3132685867","https://openalex.org/W2394974909","https://openalex.org/W3049706365","https://openalex.org/W3184502348","https://openalex.org/W3177267777","https://openalex.org/W2908094156","https://openalex.org/W2980841485","https://openalex.org/W3212045581"],"abstract_inverted_index":{"Path":[0],"planning":[1,71,96,132,148],"for":[2,69,156],"robots":[3,11,157],"is":[4,34,62],"one":[5],"of":[6,10,60,114,129,139,176,210],"the":[7,35,53,101,112,115,127,130,137,161,174,177,181,183,203,219],"important":[8],"aspects":[9],"where":[12,202],"they":[13],"need":[14],"to":[15,24,87,99,146,150,172,217],"get":[16],"an":[17,27,89],"optimal":[18,28,90,152],"and":[19,29,50,55,83,91,109,153,199,212],"obstacle-free":[20,30,92,154],"path":[21,70,95,131,147,207],"from":[22],"source":[23],"destination.":[25],"Getting":[26],"path,":[31,93],"while":[32],"traversing":[33,107,162],"core":[36],"research":[37,44],"issue":[38],"in":[39,52,125,163],"robotics.":[40],"To":[41],"address":[42],"this":[43],"issue,":[45],"several":[46],"techniques":[47],"were":[48],"proposed":[49,178],"implemented":[51],"past,":[54],"still,":[56],"a":[57,143],"good":[58],"amount":[59],"work":[61],"being":[63],"carried":[64,170],"on.":[65],"Some":[66],"well-known":[67],"algorithms":[68,97,149,193],"are":[72,215],"A*,":[73,196],"Probabilistic":[74],"Roadmap":[75],"Planner":[76],"(PRM),":[77],"Rapidly":[78],"Exploring":[79],"Random":[80],"Tree":[81],"(RRT)":[82],"RRT":[84,198,200],"Smooth.":[85],"Fundamentally,":[86],"find":[88,151],"any":[94],"needs":[98],"explore":[100],"whole":[102,116],"configuration":[103,117,164],"space,":[104],"which":[105,123],"increases":[106],"time":[108],"efforts.":[110],"However,":[111],"exploration":[113],"space":[118],"can":[119],"be":[120],"done":[121],"efficiently,":[122],"result":[124],"improving":[126],"performance":[128],"algorithms.":[133],"This":[134],"paper":[135],"addresses":[136],"use":[138],"Snake":[140,184],"Model":[141],"as":[142,195,206],"preliminary":[144],"step":[145],"paths":[155],"efficiently":[158],"by":[159],"reducing":[160],"space.":[165],"Several":[166],"experiments":[167],"have":[168],"been":[169,187],"out":[171],"show":[173],"effectiveness":[175],"setup.":[179],"In":[180],"experiments,":[182],"model":[185],"has":[186],"applied":[188],"along":[189],"with":[190],"some":[191],"standard":[192],"such":[194,205],"PRM,":[197],"Smooth,":[201],"parameters":[204],"length,":[208],"No.":[209],"Moves":[211],"Time":[213],"taken":[214],"used":[216],"record":[218],"performance.":[220]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}