{"doi":"10.1117/12.2664081","title":"Path planning and obstacle avoidance utilizing chameleon swarm algorithm","abstract":null,"journal":"Unmanned Systems Technology XXV","year":2023,"id":597132,"datarank":0.26876392038420827,"base_score":1.791759469228055,"endowment":1.791759469228055,"self_citation_contribution":0.26876392038420827,"citation_network_contribution":0.0,"self_endowment_contribution":0.26876392038420827,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":5,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1529632,"name":"Mohammad A. AlShabi","orcid":null,"position":1,"is_corresponding":false},{"id":1529634,"name":"Ali Bou Nassif","orcid":null,"position":2,"is_corresponding":false},{"id":136668,"name":"Maamar Bettayeb","orcid":null,"position":3,"is_corresponding":false},{"id":1529631,"name":"Khaled Ballous","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Path planning and obstacle avoidance utilizing chameleon swarm algorithm","abstract":"Path planning and obstacle avoidance are crucial tasks in the robotics and autonomous industry. Path planning seeks to determine the most efficient path between a start and an end point, whereas obstacle avoidance seeks to avoid collisions with static or dynamic obstacles in the environment. On this work, we utilize the Chameleon Swarm Algorithm (CSA), which is a metaheuristic approach, for path planning and obstacle avoidance on a predetermined map with static obstacles. This CSA extracted the optimal path from several possible different paths, and the results showed that it has slightly superior performance compared to PSO.","is_dataset_classified":null,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W4380590094","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2024,"count":4},{"year":2025,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://dx.doi.org/10.1117/12.2664081","host_type":""}],"fields_of_study":["Robotic Path Planning Algorithms","Control and Dynamics of Mobile Robots","Autonomous Vehicle Technology and Safety"],"mesh_terms":[],"keywords":["Obstacle avoidance","Motion planning","Obstacle","Path (computing)","Collision avoidance","Computer science","Swarm behaviour","Artificial intelligence","Any-angle path planning","Swarm robotics","Robotics","Mathematical optimization","Algorithm","Mobile robot","Robot","Mathematics","Geography","Collision","Computer network"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Industry, innovation and infrastructure"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-28T12:21:03.326083Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}