{"id":"https://openalex.org/W2148150099","doi":"https://doi.org/10.1109/ijcnn.2008.4634027","title":"A new technique for optimizing and smoothing randomized paths","display_name":"A new technique for optimizing and smoothing randomized paths","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2148150099","doi":"https://doi.org/10.1109/ijcnn.2008.4634027","mag":"2148150099"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2008.4634027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","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/A5009010539","display_name":"Sohrab Khanmohammadi","orcid":"https://orcid.org/0000-0001-5110-9442"},"institutions":[{"id":"https://openalex.org/I41832843","display_name":"University of Tabriz","ror":"https://ror.org/01papkj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I41832843"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"S. Khanmohammadi","raw_affiliation_strings":["Department of Electrical Engineering, University of Tabriz, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Tabriz, Tabriz, Iran","institution_ids":["https://openalex.org/I41832843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028560638","display_name":"Amin Mahdizadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I41832843","display_name":"University of Tabriz","ror":"https://ror.org/01papkj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I41832843"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. Mahdizadeh","raw_affiliation_strings":["Department of Electrical Engineering, University of Tabriz, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Tabriz, Tabriz, Iran","institution_ids":["https://openalex.org/I41832843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087553354","display_name":"M.T. VakilBaghnlisheh","orcid":null},"institutions":[{"id":"https://openalex.org/I87490745","display_name":"Azerbaijan University","ror":"https://ror.org/00g1psz15","country_code":"AZ","type":"education","lineage":["https://openalex.org/I87490745"]}],"countries":["AZ"],"is_corresponding":false,"raw_author_name":"M.T. VakilBaghnlisheh","raw_affiliation_strings":["University of Tabriz, Tabriz, East Azerbaijan, IR"],"affiliations":[{"raw_affiliation_string":"University of Tabriz, Tabriz, East Azerbaijan, IR","institution_ids":["https://openalex.org/I87490745"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009010539"],"corresponding_institution_ids":["https://openalex.org/I41832843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15436504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"me10","issue":null,"first_page":"1704","last_page":"1708"},"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.9958999752998352,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9882000088691711,"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/path","display_name":"Path (computing)","score":0.7741976976394653},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7202990651130676},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7063417434692383},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.6940441131591797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6488034129142761},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6323282718658447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5924188494682312},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4197181165218353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37900885939598083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2333456575870514},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18623611330986023},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.10847562551498413},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.07279729843139648},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0680345892906189}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7741976976394653},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7202990651130676},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7063417434692383},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.6940441131591797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6488034129142761},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6323282718658447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5924188494682312},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4197181165218353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37900885939598083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2333456575870514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18623611330986023},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10847562551498413},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.07279729843139648},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0680345892906189}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2008.4634027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634027","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W178120358","https://openalex.org/W1978301848","https://openalex.org/W2000359213","https://openalex.org/W2004267793","https://openalex.org/W2027693953","https://openalex.org/W2127556680","https://openalex.org/W2128990851","https://openalex.org/W2151402824","https://openalex.org/W2160645305","https://openalex.org/W2161473822","https://openalex.org/W2163178194"],"related_works":["https://openalex.org/W2576812951","https://openalex.org/W2368795992","https://openalex.org/W2908094156","https://openalex.org/W2990979393","https://openalex.org/W2966249567","https://openalex.org/W4308080200","https://openalex.org/W1997369033","https://openalex.org/W1957996277","https://openalex.org/W2591763881","https://openalex.org/W4210716962"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,10,22,35,41,51,59],"new":[6],"technique":[7],"which":[8,27],"uses":[9],"combination":[11],"of":[12,31],"two":[13],"powerful":[14],"path":[15,24,37,43,53],"planning":[16,25],"methods,":[17],"in":[18,58],"order":[19],"to":[20,50],"gain":[21],"fast":[23],"technique,":[26],"benefitpsilas":[28],"the":[29],"advantages":[30],"both":[32],"methods.":[33],"First":[34],"feasible":[36],"is":[38,48],"generated":[39],"by":[40,54],"randomized":[42],"planner,":[44],"and":[45],"then":[46],"it":[47],"leaded":[49],"sub-optimal":[52],"using":[55],"distance":[56],"transform":[57],"bounded":[60],"area.":[61]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}