Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29638


Select areas to restrict search in scientific publication database:
10010267
An Improved Dynamic Window Approach with Environment Awareness for Local Obstacle Avoidance of Mobile Robots
Abstract:
Local obstacle avoidance is critical for mobile robot navigation. It is a challenging task to ensure path optimality and safety in cluttered environments. We proposed an Environment Aware Dynamic Window Approach in this paper to cope with the issue. The method integrates environment characterization into Dynamic Window Approach (DWA). Two strategies are proposed in order to achieve the integration. The local goal strategy guides the robot to move through openings before approaching the final goal, which solves the local minima problem in DWA. The adaptive control strategy endows the robot to adjust its state according to the environment, which addresses path safety compared with DWA. Besides, the evaluation shows that the path generated from the proposed algorithm is safer and smoother compared with state-of-the-art algorithms.
Digital Object Identifier (DOI):

References:

[1] Hoy, Michael, Alexey S. Matveev, and Andrey V. Savkin, “Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey,” Robotica, vol. 33, pp. 463-497, 2015.
[2] Borenstein, Johann, and Yoram Koren, “Real-time obstacle avoidance for fast mobile robots,” IEEE Transactions on systems, Man, and Cybernetics, vol. 19, pp. 1179-1187, 1989.
[3] Borenstein, Johann, and Yoram Koren, “The vector field histogram-fast obstacle avoidance for mobile robots,” IEEE transactions on robotics and automation, vol. 7, pp. 278-288, 1991.
[4] Ulrich, Iwan, and Johann Borenstein, “VFH+: Reliable obstacle avoidance for fast mobile robots,” in Proc. ICRA Conf., 1998, pp. 1572-1577.
[5] Weerakoon, Tharindu, Kazuo Ishii, and Amir Ali Forough Nassiraei, “An artificial potential field based mobile robot navigation method to prevent from deadlock,” Journal of Artificial Intelligence and Soft Computing Research, vol. 5, pp. 189-203, 2015.
[6] Demir, Mustafa, and Volkan Sezer, “Improved follow the gap method for obstacle avoidance,” in Advanced Intelligent Mechatronics (AIM), 2017, pp. 1435-1440.
[7] Simmons, Reid, “The curvature-velocity method for local obstacle avoidance,” in Proc. ICRA Conf., 1996, pp. 3375-3382.
[8] Fox, Dieter, Wolfram Burgard, and Sebastian Thrun, “The dynamic window approach to collision avoidance,” IEEE Robotics & Automation Magazine, vol. 4, pp. 23-33, 1997.
[9] Ulrich, Iwan, and Johann Borenstein, “VFH*: Local obstacle avoidance with look-ahead verification,” in Proc. ICRA Conf., 2000, pp. 2505-2511.
[10] Chou, Chih-Chung, Feng-Li Lian, and Chieh-Chih Wang, “Characterizing indoor environment for robot navigation using velocity space approach with region analysis and look-ahead verification,” IEEE Transactions on Instrumentation and Measurement, vol. 60, pp. 442-451, 2011.
[11] Blanco, Jose Luis, Mauro Bellone, and Antonio Gimenez-Fernandez, “TP-Space RRT: kinematic path planning of non-holonomic any-shape vehicles,” International Journal of Advanced Robotic Systems, vol. 12, pp. 55-63, 2015.
[12] Devaurs D, Simon T and Corts J, “Optimal path planning in complex cost spaces with sampling-based algorithms,” IEEE Transactions on Automation Science and Engineering, vol. 13, pp. 415-424, 2016.
[13] Samaniego, Ricardo, Joaquin Lopez, and Fernando Vazquez, “Path planning for non-circular, non-holonomic robots in highly cluttered environments,” Sensors, vol. 17, pp. 1876-1894, 2017.
[14] Napoli, Michael E., Harel Biggie, and Thomas M. Howard, “Learning models for predictive adaptation in state lattices,” Field and Service Robotics, vol. 5, pp. 285-300, 2018.
[15] Van Vliet, Lucas J., and Piet W. Verbeek, “Curvature and bending energy in digitized 2D and 3D images,” in Proceedings of the Scandinavian Conference on Image Analysis, 1993, pp. 1403-1410.
Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007