Results 241 to 250 of about 1,272,123 (296)

Path Planning for Robots Based on Adaptive Dual-Layer Ant Colony Optimization Algorithm and Adaptive Dynamic Window Approach

IEEE Sensors Journal
To address the limitations of ant colony optimization (ACO) algorithm in terms of convergence speed, search efficiency, local optimal traps, and dependence on high-precision maps, this article proposes adaptive dual layer ACO (ADL-ACO) algorithm and ...
Yuting Liu, Shijie Guo, Shufeng Tang, Junhui Song, Jun Zhang   +4 more
semanticscholar   +1 more source

Dynamic Window Approach for omni-directional robots with polygonal shape

2011 IEEE International Conference on Robotics and Automation, 2011
This work presents an extension of the Dynamic Window Approach. The reactive collision avoidance algorithm is generalized to the case of omni-directional kinematics for any polygonal shaped, mobile robot. This paper includes a superior implementation to former realizations and has already been successfully tested with an omni-directional robot.
Andreas Lawitzky, Daniel Althoff, Dirk Wollherr, Martin Buss   +3 more
openaire   +1 more source

Approximate inference for dynamic Bayesian networks: sliding window approach

Applied Intelligence, 2013
Dynamic Bayesian networks (DBNs) are probabilistic graphical models that have become a ubiquitous tool for compactly describing statistical relationships among a group of stochastic processes. A suite of elaborately designed inference algorithms makes it possible for intelligent systems to use a DBN to make inferences in uncertain conditions ...
Xiaoguang Gao 0001, Jun-Feng Mei, Hai-Yang Chen 0004, Da-Qing Chen 0001   +3 more
openaire   +1 more source

A hybrid approach for the dynamic vehicle routing problem with time windows

Fifth International Conference on Hybrid Intelligent Systems (HIS'05), 2005
The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem. The static version of this problem has received special attention. However, most real world vehicle routing problems are dynamic, where information relevant to the routing can change after the initial routes have been constructed.
Guilherme Bastos Alvarenga, Ricardo Martins Abreu e Silva, Geraldo Robson Mateus   +2 more
openaire   +1 more source

High-speed navigation using the global dynamic window approach

Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), 2003
Many applications in mobile robotics require the safe execution of a collision-free motion to a goal position. Planning approaches are well suited for achieving a goal position in known static environments, while real-time obstacle avoidance methods allow reactive motion behavior in dynamic and unknown environments.
Oliver Brock, Oussama Khatib
openaire   +1 more source

Safe and Efficient Dynamic Window Approach for Differential Mobile Robots With Stochastic Dynamics Using Deterministic Sampling

IEEE Robotics and Automation Letters, 2023
We propose an efficient and safe dynamic window approach (DWA) by using deterministic sampling. When the system dynamics have uncertainty, the control input includes errors, so that the DWA objective function becomes a random variable.
Shinya Yasuda, Taichi Kumagai, H. Yoshida   +2 more
semanticscholar   +1 more source

An Improved Dynamic Window Approach Integrated Global Path Planning

2019 IEEE International Conference on Robotics and Biomimetics (ROBIO), 2019
Aiming at the shortcomings of dynamic windowing algorithm (DWA) into local optimal solution. This work studys a modified DWA algorithm integrated global path planning. By introducing the result of global path planning as a reference trajectory, a novel evaluation function is designed which makes the optimal trajectory be guaranteed.
Fuhai Zhang, Ning Li, Tiegang Xue, Ying Zhu, Rupeng Yuan, Yili Fu   +5 more
openaire   +1 more source

Path planning for mobile robots in complex environments based on enhanced sparrow search algorithm and dynamic window approach

Robotica (Cambridge. Print)
Traditional path planning algorithms often encounter challenges in complex dynamic environments, including local optima, excessive path lengths, and inadequate dynamic obstacle avoidance.
Yixuan Luo, Shusen Lin, Yifan Wang, Kai Liang   +3 more
semanticscholar   +1 more source

Collision-Free Dynamic Window Approach for Moving Obstacles

Volume 3A: 48th Design Automation Conference (DAC), 2022
Abstract Dynamic window approach (DWA) is known as collision-free for static obstacles with proper design. Under static operation conditions, if there is no admissible velocity within the velocity dynamic window, the agent reduces the velocity as much as possible.
openaire   +1 more source

Improved Dynamic Window Approach for UAV Local Path Planning in Multi‐Dynamic Obstacles Environments Using Sparrow Search Algorithm

Transactions on Emerging Telecommunications Technologies
The traditional Dynamic Window Approach (DWA) for local path planning of unmanned aerial vehicles (UAVs) exhibits limitations in flexibility and robustness.
Lin Zhang, Yan Li, Yang Yu, Yao Zhao, Wei Song, Gunther Retscher   +5 more
semanticscholar   +1 more source