The article deals with a novel approach to reactive navigation. A proposed reactive navigation is based on the Vector Field Histogram (VFH) method, which is easily modifiable. The biggest advantage of the proposed method is that it allows the robot to avoid static as well as moving obstacles in an unknown environment in a more effective way and without the need of switching any algorithm or the robot’s behaviour. Moreover, the proposed extension allows the avoidance of several moving obstacles in real time. The article contains three proposed improvements of the original VFH* method: representation of moving objects, look-ahead tree improvements and approach to criterion function. The method is verified by several experiments in various scenarios, which include few static and moving obstacles.
AnDWangH (2004) VPH: A new laser radar based obstacle avoidance method for intelligent mobile robots. In: Proceedings of IEEE 5th World Congress on Intelligent Control and Automation, New Jersey, 15–19 June 2004, pp. 4681–4685.
2.
BorensteinJKorenY (1991) The Vector Field Histogram – Fast obstacle avoidance for mobile robots. IEEE Journal of Robotics and Automation7(3): 278–288.
3.
CalderitaLVBanderaJPMansoLJ. (2014) 3D Laser from RGBD Projections in Robot Local Navigation. León, Spain: Workshop of Physical Agents.
4.
ChosetHLynchKMHutchinsonS. (2005) Principles of Robot Motion (Theory, Algorithms, and Implementations). Boston, MIT Press.
5.
CousinsS (2011) Exponential growth of ROS. IEEE Robotics & Automation Magazine18(1): 19–20.
6.
CousinsS (2012) Is ROS good for robotics?IEEE Robotics & Automation Magazine19(2): 13–26.
7.
DongJMaXPengK (2010) IVHF*: Real-time dynamic obstacle avoidance for mobile robots. In: Proceedings of 11th International Conference on Control, Automation, Robotics and Vision, Singapore, 7–10 December 2010, pp. 844–847.
8.
EndresFHessJEngelhardN. (2012) An evaluation of the RGB-D SLAM system. In: IEEE International Conference on Robotics and Automation, RiverCentre, Saint Paul, Minnesota, USA, 14–18 May 2012, pp. 1691–1696.
9.
EssALeibeBSchindlerK. (2009) Moving obstacle detection in highly dynamic scenes. In: IEEE International Conference on Robotics and Automation, Kobe, 12–17 May 2009, pp. 4451–4458. Kobe, Japan: Kobe International Conference Center.
10.
FergusonDDarmsMUrmsonC. (2008) Detection, prediction, and avoidance of dynamic obstacles in urban environments. In: IEEE Intelligent Vehicles Symposium, Eindhoven, The Netherlands, 4–6 June 2008, pp. 1149–1154. IEEE.
11.
FoxDBurgardWThrunS (1997) The dynamic window approach to collision avoidance. IEEE Robotics and Automation4(1): 23–33.
12.
GiesbrechtJ (2005) Local navigation for unmanned ground vehicles, a survey. Report, Defence R&D Canada. Suffield, Technical Memorandum.
13.
HamadAHIbrahimFB (2010) Path planning of mobile robot based on modification of Vector Field Histogram using Neuro-Fuzzy algorithm. International Journal of Advancements in Computing Technology2(3): 129–138.
14.
JurišicaLDuchoňFBainecA (2010) Standard directional reactive navigation of mobile robots. AT & P Journal17(8): 1–5.
15.
KhailiML (2014) Visibility graph for path planning in the presence of moving obstacles. IRACST – Engineering Science and Technology: An International Journal (ESTIJ)4(4): 118–123.
16.
LabayradeRRoyereCGruyerD. (2005) Cooperative fusion for multi-obstacles detection with use of stereovision and laser scanner. Autonomous Robots19(2): 117–140.
17.
LuoCKrishnanMPaulikM. (2012) Navigating with VFH: A strategy to avoid traps. In: RöningJCasasentDP (eds) Proceedings of the SPIE 8301, Intelligent Robots and Computer Vision XXIX: Algorithms and Techniques, Burlingame, California, USA, 22 January 2012, pp. 1–11.
18.
MinguezJMontanoL (2000) Nearness Diagram Navigation (ND) (a new real time collision avoidance approach). In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.
19.
MinguezJMontanoL (2003) The Obstacle-Restriction Method (ORM) for Robot Obstacle Avoidance in Difficult Environments. Zaragoza, Spain: Instituto de Investigación en Ingeniería de Aragón, Dept. de Informática e Ingeniería de Sistemas, Universidad de Zaragoza.
20.
MurphyRR (2000) Introduction to AI Robotics. Cambridge, MA: Massachusetts Institute of Technology.
21.
PlakuE (2010) CS 336/436 Algorithms for sensorbased robotics. Lecture II, III: Bug path-planning algorithms, Department of Computer Science, Laboratory for Computational Sensing and Robotics, John Hopkins University.
22.
SiegwartRNourbakhshIR (2014) Introduction to Autonomous Mobile Robots. London: MIT Press.
23.
SimmonsR (1996) The curvature-velocity method for local obstacle avoidance. In: International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, 22–28 April 1996, pp. 3375–3382. IEEE.
24.
SturmJEngelhardNEndresF. (2012) A benchmark for the evaluation of RGB-D SLAM systems. In: IEEE International Conference on Intelligent Robots and Systems, Vilamoura, Algarve, Portugal, 7–12 October 2012, pp. 573–580.
25.
SubramanianMBSudhagarKRajarajeswariG (2015) Autonomous mobile robot agent path planning based on VFH method using heuristic based optimal algorithm. International Journal of Applied Engineering Research10(6): 5189–5194.
26.
UlrichIBorensteinJ (1998) VFH+: Reliable obstacle avoidance for fast mobile robots. In: Proceedings of the IEEE International Conference of Robotics and Automation, Leuven, Belgium, 20 May 1998, pp. 1572–1577.
27.
UlrichIBorensteinJ (2000) VFH*: Local obstacle avoidance with look-ahead verification. In: Proceedings of the IEEE International Conference of Robotics and Automation, San Francisco, CA, USA, April 2000, pp. 2505–2511.
28.
VannesteSBellekensBWeynM (2014) 3DVFH+: Real-time three-dimensional obstacle avoidance using an Octomap. MORSE 1st International Workshop on Model-Driven Robot Software Engineering, York, UK, Vol. 1319, pp. 91–102.
29.
VargašMHajdukMSemjonJ. (2011) The view to the current state of robotics. Advanced Materials Research463–464: 1711–1714.
30.
VikenmarkD (2006) The Obstacle-Restriction Method (ORM) for reactive obstacle avoidance in difficult scenarios in three-dimensional workspaces. Master of Science Thesis, Stockholm: KTH Royal Institute of Technology. Department of Computer Science and Communication.
31.
YamauchiB (2005) The wayfarer modular navigation payload for intelligent robot infrastructure. In: Proceedings of SPIE, Orlando, 2 June 2005, pp. 85–96.
32.
YapPKYBurchNHolteRC. (2011) Any-Angle Path Planning for Computer Games. In: Proceedings of the AAAI conference on Artificial Intelligence and Interactive Digital Entertainment. Palo Alto, California, USA: AAAI Press, pp. 201–207.
33.
YeC (2007) Navigating a mobile robot by a traversability field histogram. IEEE Transactions on Systems, Man, and Cybernetics37(2): 361–372.
34.
YouBQiuJLiD (2008) A novel obstacle avoidance method for low-cost household mobile robot. In: Proceedings of the IEEE International Conference on Automation and Logistics, Qingdao, 30 September 2008, pp. 111–116.
35.
ŽaludLKopecnýLBurianF (2009) Robotic systems for special reconnaissance. In: International Conference on Military Technologies, Brno, Czech Republic, Oprox, pp. 531–540.
36.
ZhuYZhangTSongJ. (2012) A new method for mobile robots to avoid collision with moving obstacle. Artificial Life and Robotics16(4): 507–510.
