[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-463424-105":59,"doc-detail-463424-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","path-planning-for-delivery-robots-based-on-an-improved-ant-colony-optimization-algorithm-combined-with-dynamic-window-approach","Path Planning for Delivery Robots Based on an Improved Ant Colony Optimization Algorithm Combined with Dynamic Window Approach","","Meal delivery robot path planning focuses on finding obstacle-free routes in the workspace, but standard ant colony optimization often converges slowly and performs blind search while lacking strong dynamic obstacle avoidance. Dynamic window approach methods can get trapped in local optima during local planning. A hybrid method combining improved IACO and DWA introduces gravity-inspired guidance, path sorting, and extra pheromone updates for faster convergence and smoother trajectories. Globally optimal path key nodes become local targets for DWA to handle both static and dynamic obstacles. Simulations show up to 30.03% shorter paths and up to 71.43% fewer turns in static maps, with smoother safe paths in dynamic tests.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/path-planning-for-delivery-robots-based-on-an-improved-ant-colony-optimization-algorithm-combined-with-dynamic-window-approach/463424/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/path-planning-for-delivery-robots-based-on-an-improved-ant-colony-optimization-algorithm-combined-with-dynamic-window-approach/463424.png","ImageObject",300,407,{"name":92,"@type":93},"Mafia Boss","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-02","2026-09-30",true,{"@type":102,"interactionType":103,"userInteractionCount":52},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"Why is traditional ant colony optimization limited for delivery robot path planning?","Question",{"text":112,"@type":113},"It tends to converge slowly, performs blind search behavior, and lacks dynamic obstacle avoidance functionality.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What local-planning issue can the dynamic window approach face?",{"text":117,"@type":113},"During local path planning, it can become trapped in local optima.",{"name":119,"@type":110,"acceptedAnswer":120},"How does the proposed hybrid algorithm improve path quality and dynamic obstacle avoidance?",{"text":121,"@type":113},"It combines improved IACO with DWA, using gravity-inspired guidance, path sorting, and pheromone updates to accelerate convergence and smooth transitions, then uses globally optimal key nodes as local targets for DWA to avoid static and dynamic obstacles.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},463424,1790837766,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":52,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":41,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":143,"read_time":144,"preview_page_count":19,"preview_urls":145},962090760730,"https://ap-avatar.wpscdn.com/davatar_9964176cb1d06d4a9deccf72a44ae3dc","Article  \nPath Planning for Delivery Robots Based on an Improved Ant Colony Optimization Algorithm Combined with Dynamic Window Approach  \nLimin Huang 1,†, Tao Hu 1, Jiabao Wei 2,†, Yifeng Guo 1,*, Xubin Tong 1, Jiaxin Ding 1, Hao Yang 1 and Bin Zhong 1  \nAcademic Editor: Yingbai Hu  \nReceived: 2 November 2025  \nRevised: 4 December 2025  \nAccepted: 18 December 2025  \nPublished: 22 December 2025  \nCopyright: © 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.  \n1 School of Mechanical Engineering, Chengdu University, Chengdu 610106, China; [hlmsn155@163.com](hlmsn155@163.com) (L.H.); [hutao202500@163.com](hutao202500@163.com) (T.H.); [txb15158382526@163.com](txb15158382526@163.com) (X.T.)  \n2 Multipurpose Utilization of Mineral Resources, Chinese Academy of Geological Sciences, Chengdu 610041, China  \n* Correspondence: [guobujia2000@163.com](guobujia2000@163.com)  \n† These authors contributed equally to this work.  \nAbstract  \nIn meal delivery robot path planning, enabling the robot to find an optimal path that avoids obstacles within its workspace is a crucial step. Usually, the traditional ant colony optimization (ACO) suffers from slow convergence and blind search behavior in path planning, lacking dynamic obstacle avoidance functionality. Meanwhile, the dynamic window approach (DWA) tends to become entrapped in local optima during local path planning. It is therefore proposed that a hybrid path planning algorithm be developed, based on an improved IACO and DWA algorithm. To address issues such as aimless search, slow convergence speed, and low path smoothness in ACO, the concept of gravity from gravity search algorithms is introduced to direct the search. The acceleration of convergence is achieved through the implementation of path sorting and the administration of additional pheromone to superior paths in pheromone updates. The transition paths are optimized to address the issue of excessive path transitions in ACO, resulting in smoother paths. The key nodes of the obtained globally optimal path are used as local target points, serving as multiple target points for DWA operation to enable dynamic obstacle avoidance. Simulation results indicate that compared to the ACO, the IACO reduces path length by up to 30.03% and decreases path turns by up to 71.43% in four different static maps. In other static comparison experiments, the IACO demonstrated superior performance compared to the other tested algorithms. In dynamic experiments, the proposed fusion algorithm can plan smooth paths that successfully avoid both static and dynamic obstacles.  \nKeywords: food delivery robot; path planning; ant colony optimization algorithm; dynamic window approach; algorithm combination  \n1. Introduction  \nDue to the rapid advancement of intelligent technologies, robotics has found applications across multiple domains [1,2] . Currently, the most prevalent are service robots, capable of performing tasks beneficial to humans. As a subset of service robots, delivery robots are increasingly deployed in venues such as hotels, restaurants, and shopping centers. Given the complexity of restaurant environments, path planning technology has emerged as pivotal element in enabling delivery robots to navigate to their destinations [3] . Path planning algorithms for delivery robots are primarily categorized into two types:  \nglobal path planning and local path planning [4] . During operation, delivery robots require not only effective global path planning to determine optimal routes but also local path planning with obstacle avoidance capabilities to navigate dynamically changing obstacles.  \nIn robot path planning, common algorithms employed for global path planning include the A* algorithm [5], rapidly exploring random tree (RRT) [6], the genetic algorithm (GA) [7], sparrow search algorithm (SSA) [8], and ant colony ","cbCaicQpfzuNdz6w","https://ap.wps.com/l/cbCaicQpfzuNdz6w","pdf",8527474,"English","# Introduction\n## Global and local path planning\n## Ant colony optimization for global planning\n## Motivation and related work","[{\"question\":\"Why is traditional ant colony optimization limited for delivery robot path planning?\",\"answer\":\"It tends to converge slowly, performs blind search behavior, and lacks dynamic obstacle avoidance functionality.\"},{\"question\":\"What local-planning issue can the dynamic window approach face?\",\"answer\":\"During local path planning, it can become trapped in local optima.\"},{\"question\":\"How does the proposed hybrid algorithm improve path quality and dynamic obstacle avoidance?\",\"answer\":\"It combines improved IACO with DWA, using gravity-inspired guidance, path sorting, and pheromone updates to accelerate convergence and smooth transitions, then uses globally optimal key nodes as local targets for DWA to avoid static and dynamic obstacles.\"}]","Path Planning for Delivery Robots Based on an Improved Ant Colony Optimization Algorithm Combined with Dynamic Window Approach | PDF",1790766554,76,[146,150,154,158],{"page_no":8,"url":147,"width":148,"height":149},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/16277006749e0d34a3c9075abb2142b3.webp",983,1390,{"page_no":14,"url":151,"width":152,"height":153},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/c18b0fd84d031ea21e122e623a502fc9.webp",982,1388,{"page_no":81,"url":155,"width":156,"height":157},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/1f964541fc3a1fa792f0fa33c394f08f.webp",981,1387,{"page_no":19,"url":159,"width":160,"height":161},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/babd90ea96f7b8709b85e8efb8675379.webp",980,1385]