{"id":"https://openalex.org/W2168826432","doi":"https://doi.org/10.1109/iccar.2015.7166004","title":"Mobile robot path planning for circular shaped obstacles using simulated annealing","display_name":"Mobile robot path planning for circular shaped obstacles using simulated annealing","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W2168826432","doi":"https://doi.org/10.1109/iccar.2015.7166004","mag":"2168826432"},"language":"en","primary_location":{"id":"doi:10.1109/iccar.2015.7166004","doi":"https://doi.org/10.1109/iccar.2015.7166004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccar.2015.7166004","pdf_url":null,"source":{"id":"https://openalex.org/S7407088985","display_name":"International Conference on Control, Automation and Robotics (ICCAR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Control, Automation and Robotics","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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":null,"display_name":"Sikandar Hayat","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I899713450","display_name":"Air University","ror":"https://ror.org/03yfe9v83","country_code":"PK","type":"education","lineage":["https://openalex.org/I899713450"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Sikandar Hayat","raw_affiliation_strings":["Department of Mechatronics Engineering, Air University, Islamabad, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechatronics Engineering, Air University, Islamabad, Pakistan","institution_ids":["https://openalex.org/I899713450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016511127","display_name":"Zareena Kausar","orcid":"https://orcid.org/0000-0002-9157-6296","observed_orcids":["https://orcid.org/0000-0002-9157-6296"]},"institutions":[{"id":"https://openalex.org/I899713450","display_name":"Air University","ror":"https://ror.org/03yfe9v83","country_code":"PK","type":"education","lineage":["https://openalex.org/I899713450"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Zareena Kausar","raw_affiliation_strings":["Department of Mechatronics Engineering, Air University, Islamabad, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechatronics Engineering, Air University, Islamabad, Pakistan","institution_ids":["https://openalex.org/I899713450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I899713450"],"apc_list":null,"apc_paid":null,"fwci":0.4085,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.52580743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"5","issue":null,"first_page":"69","last_page":"73"},"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/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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mobile-robot-path-planning","display_name":"mobile robot path planning","score":0.9900000095367432},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.921999990940094},{"id":"https://openalex.org/keywords/circular-obstacles","display_name":"circular obstacles","score":0.9629999995231628},{"id":"https://openalex.org/keywords/collision-free-paths","display_name":"collision-free paths","score":0.8880000114440918},{"id":"https://openalex.org/keywords/optimal-paths","display_name":"optimal paths","score":0.5730000138282776},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.7889999747276306}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8832316994667053},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8506668210029602},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6561328172683716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6334915161132812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.584088146686554},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5781374573707581},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5672615766525269},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5618677735328674},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5029136538505554},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4925547242164612},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4793287515640259},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47473129630088806},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.4628339111804962},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.3775913119316101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2944053113460541},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23680946230888367},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.20015263557434082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19692450761795044},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C2987804222","wikidata":"https://www.wikidata.org/wiki/Q5376582","display_name":"End point","level":2,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccar.2015.7166004","doi":"https://doi.org/10.1109/iccar.2015.7166004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccar.2015.7166004","pdf_url":null,"source":{"id":"https://openalex.org/S7407088985","display_name":"International Conference on Control, Automation and Robotics (ICCAR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Control, Automation and Robotics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W29624342","https://openalex.org/W101508493","https://openalex.org/W1519405745","https://openalex.org/W1544329015","https://openalex.org/W1965440866","https://openalex.org/W2101938656","https://openalex.org/W2103120971","https://openalex.org/W2110815715","https://openalex.org/W2151299975","https://openalex.org/W2154522324","https://openalex.org/W3159068915","https://openalex.org/W4247564405"],"related_works":["https://openalex.org/W2061423370","https://openalex.org/W4319775609","https://openalex.org/W2151299975","https://openalex.org/W2367135232","https://openalex.org/W2170886993","https://openalex.org/W7014292788","https://openalex.org/W7204870333","https://openalex.org/W4240332390","https://openalex.org/W1578493987","https://openalex.org/W2806657560"],"abstract_inverted_index":{"Many":[0],"heuristic":[1],"methods":[2],"are":[3],"used":[4,53],"for":[5,42,65],"path":[6,43,59,71],"planning":[7],"by":[8,74],"researchers":[9],"in":[10,78,92],"the":[11,29,48,89],"past":[12],"and":[13,28],"contemporary":[14],"work":[15],"but":[16],"due":[17],"to":[18,54,83],"easy":[19],"implementation,":[20],"convergence":[21],"properties,":[22],"capability":[23],"of":[24,31,76,88],"escaping":[25],"local":[26],"optima":[27],"use":[30],"hill-climbing":[32],"moves":[33],"have":[34],"made":[35],"simulated":[36,49],"annealing":[37,50],"(SA)":[38],"a":[39,56,66],"good":[40],"choice":[41],"planning.":[44],"In":[45],"this":[46],"research":[47],"algorithm":[51,91],"is":[52,72,95],"obtain":[55],"collision-free":[57],"optimal":[58],"among":[60],"fixed":[61],"circular":[62],"shaped":[63],"obstacles":[64],"mobile":[67],"robot.":[68],"A":[69],"feasible":[70],"computed":[73],"series":[75],"points":[77],"cells":[79],"generated":[80],"between":[81],"start":[82],"goal":[84],"point.":[85],"The":[86],"effectiveness":[87],"proposed":[90],"different":[93],"environments":[94],"shown":[96],"through":[97],"simulation":[98],"results.":[99]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}