{"id":"https://openalex.org/W4318240622","doi":"https://doi.org/10.3233/ais-220292","title":"A novel directional sampling-based path planning algorithm for ambient intelligence navigation scheme in autonomous mobile robots","display_name":"A novel directional sampling-based path planning algorithm for ambient intelligence navigation scheme in autonomous mobile robots","publication_year":2023,"publication_date":"2023-01-27","ids":{"openalex":"https://openalex.org/W4318240622","doi":"https://doi.org/10.3233/ais-220292"},"language":"en","primary_location":{"id":"doi:10.3233/ais-220292","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ais-220292","pdf_url":null,"source":{"id":"https://openalex.org/S2492266406","display_name":"Journal of Ambient Intelligence and Smart Environments","issn_l":"1876-1364","issn":["1876-1364","1876-1372"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Ambient Intelligence and Smart Environments","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/A5068352510","display_name":"Sivasankar Ganesan","orcid":"https://orcid.org/0000-0002-9255-9631"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sivasankar Ganesan","raw_affiliation_strings":["Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College, Sivakasi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, Mepco Schlenk Engineering College, Sivakasi, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112748993","display_name":"Senthil Kumar Natarajan","orcid":"https://orcid.org/0000-0002-1197-5546"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Senthil Kumar Natarajan","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Mepco Schlenk Engineering College, Sivakasi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Mepco Schlenk Engineering College, Sivakasi, India","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Senthil Kumar Natarajan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Senthil Kumar Natarajan","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Mepco Schlenk Engineering College, Sivakasi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Mepco Schlenk Engineering College, Sivakasi, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068352510"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1489,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79828198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"3","first_page":"269","last_page":"284"},"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.9976000189781189,"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.9854000210762024,"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/motion-planning","display_name":"Motion planning","score":0.8481606841087341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7250565886497498},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.61432284116745},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6055061221122742},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5961588025093079},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5869067311286926},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.48090147972106934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.478792279958725},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4756750166416168},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4598582088947296},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4562162458896637},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4470953345298767},{"id":"https://openalex.org/keywords/fast-marching-method","display_name":"Fast marching method","score":0.4229260981082916},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4207550883293152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3862241208553314},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.22112804651260376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1667231023311615}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8481606841087341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7250565886497498},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.61432284116745},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6055061221122742},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5961588025093079},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5869067311286926},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.48090147972106934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.478792279958725},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4756750166416168},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4598582088947296},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4562162458896637},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4470953345298767},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.4229260981082916},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4207550883293152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3862241208553314},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.22112804651260376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1667231023311615},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/ais-220292","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ais-220292","pdf_url":null,"source":{"id":"https://openalex.org/S2492266406","display_name":"Journal of Ambient Intelligence and Smart Environments","issn_l":"1876-1364","issn":["1876-1364","1876-1372"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Ambient Intelligence and Smart Environments","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W128860527","https://openalex.org/W1592908984","https://openalex.org/W1777783943","https://openalex.org/W1927261824","https://openalex.org/W1976930960","https://openalex.org/W1987188608","https://openalex.org/W2000359213","https://openalex.org/W2019738489","https://openalex.org/W2055201760","https://openalex.org/W2080823437","https://openalex.org/W2096310853","https://openalex.org/W2118730279","https://openalex.org/W2128990851","https://openalex.org/W2211552581","https://openalex.org/W2261483311","https://openalex.org/W2344101821","https://openalex.org/W2526007611","https://openalex.org/W2550404423","https://openalex.org/W2557741120","https://openalex.org/W2575903693","https://openalex.org/W2877466430","https://openalex.org/W2909688514","https://openalex.org/W2933211032","https://openalex.org/W2981655353","https://openalex.org/W2985821384","https://openalex.org/W3006097963","https://openalex.org/W3011646207","https://openalex.org/W3016164434","https://openalex.org/W3033772177","https://openalex.org/W3044358537","https://openalex.org/W3101748532","https://openalex.org/W3102121895","https://openalex.org/W3104753760","https://openalex.org/W3114748666","https://openalex.org/W3181323247","https://openalex.org/W3217170181","https://openalex.org/W4206185643","https://openalex.org/W4211225190"],"related_works":["https://openalex.org/W1660309994","https://openalex.org/W2368795992","https://openalex.org/W3195318120","https://openalex.org/W3179692821","https://openalex.org/W2154416327","https://openalex.org/W1870406129","https://openalex.org/W2122025706","https://openalex.org/W4312191671","https://openalex.org/W2982486675","https://openalex.org/W3216757130"],"abstract_inverted_index":{"Path":[0],"planning":[1,18,41,58,109,159,202],"algorithms":[2,19],"determine":[3],"the":[4,7,44,65,72,79,98,145,149,173,178,181,183,190,194],"performance":[5,125,171],"of":[6,71,121,175,180,185,208,223],"ambient":[8],"intelligence":[9],"navigation":[10],"schemes":[11],"in":[12,23,113,169,210,220],"autonomous":[13,24],"mobile":[14,25],"robots.":[15],"Sampling-based":[16],"path":[17,40,57,108,158,195,201],"are":[20],"widely":[21],"employed":[22],"robot":[26,143],"applications.":[27],"RRT*,":[28],"or":[29],"Optimal":[30],"Rapidly":[31],"Exploring":[32],"Random":[33],"Trees,":[34],"is":[35,75,111,126,137,161,216],"a":[36,52,92,118,141,205],"very":[37],"effective":[38],"sampling-based":[39,55],"algorithm.":[42],"However,":[43],"RRT*":[45,56,132,165,168],"solution":[46],"converges":[47],"slowly.":[48],"This":[49],"study":[50],"proposes":[51],"directional":[53,84,100],"random":[54,93],"algorithm":[59,110,160,203],"known":[60],"as":[61],"DR-RRT*":[62,157,199],"to":[63,96,128],"address":[64],"slow":[66],"convergence":[67],"issue.":[68],"The":[69,106,155,197],"novelty":[70],"proposed":[73,107,156,198],"method":[74,102],"that":[76],"it":[77,187,215],"reduces":[78],"search":[80],"space":[81],"by":[82],"combining":[83],"non-uniform":[85,99],"sampling":[86,101],"with":[87,103,117,144],"uniform":[88,104],"sampling.":[89,105],"It":[90],"employs":[91],"selection":[94],"approach":[95],"combine":[97],"validated":[112],"three":[114,212],"different":[115],"environments":[116],"map":[119],"size":[120],"384*384,":[122],"and":[123,133,148,166,189,214],"its":[124],"compared":[127],"two":[129],"existing":[130],"algorithms:":[131],"Informed":[134,167],"RRT*.":[135],"Validation":[136],"carried":[138],"out":[139],"utilizing":[140],"TurtleBot3":[142],"Gazebo":[146],"Simulator":[147],"Robotics":[150],"Operating":[151],"System":[152],"(ROS)":[153],"Melodic.":[154],"better":[162],"than":[163],"both":[164],"four":[170],"measures:":[172],"number":[174],"nodes":[176],"visited,":[177],"length":[179],"path,":[182],"amount":[184],"time":[186],"takes,":[188],"rate":[191,207],"at":[192],"which":[193],"converges.":[196],"global":[200],"achieves":[204],"success":[206],"100%":[209],"all":[211,221],"environments,":[213],"suited":[217],"for":[218],"use":[219],"kinds":[222],"environments.":[224]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-11T06:02:39.374780","created_date":"2025-10-10T00:00:00"}