Computational Intelligence and Neuroscience

Computational Intelligence and Neuroscience / 2016 / Article
Special Issue

Advances in Neural Networks and Hybrid-Metaheuristics: Theory, Algorithms, and Novel Engineering Applications

View this Special Issue

Research Article | Open Access

Volume 2016 |Article ID 6540807 | 10 pages | https://doi.org/10.1155/2016/6540807

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm

Academic Editor: Marco A. M. Armendariz
Received26 Aug 2015
Revised23 Nov 2015
Accepted15 Dec 2015
Published12 Jan 2016

Abstract

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.

1. Introduction

In recent years, with the increase in the number of cars, traffic accidents happen more and more frequently, most of which are caused by man-made mistakes and serious threat to people’s live and social stability. Thus, “car-people-road” mode is converted to “car-computer-road” mode, which can be liberated from driving environment and is one of the effective ways to reduce traffic accident. The unmanned ground vehicle has become a hot issue domestic and international research [13]. The DARPA (Defense Advanced Research Projects Agency) proposed a series of control technology for the unmanned vehicle and digital road traffic control scheme under the urban road environment, which is the most important for the path planning and controlling [49].

This paper mainly focused on the intelligent vehicle navigation problems, especially the path planning, and guiding the vehicles to the target position. At present, the traditional path planning methods, including potential field and grid method, are prone to local minimum problems [10, 11]. The bionic path planning algorithms, including genetic algorithm, ant colony algorithm, and particle swarm algorithm, need to determine the coding scheme and the optimization of objective function [1217]. The intelligent path planning algorithms, including BP neural network, ANN, and fuzzy neural network learning methods, need constant learning and training to obtain the optimal path; the network settings of the intermediate nodes of these methods are often dependent on experience and constant trial and error [1821]. These are only from the perspective of the planning. However, the navigation path of the intelligent vehicle should not only contain trace paths but also contain the time information (namely, speed), for real-time tracking control. The above methods including field method, bionic method, and intelligent information do not include the time in the path planning.

In 1995, behavioral dynamics method is first proposed by Schöner et al. [22]; it has been applied to a mobile robot system, complex structured environment navigation control, machine control arms, and multirobot formations navigation control [2331]. Due to its outstanding performance, scholars began to pay attention to relevant theorem studying and application research [3238]. Behavior dynamics method is introduced into the intelligent vehicle navigation planning and in-depth research and experiments verify the feasibility of this method.

The aim of the paper is to discuss the intelligent vehicle path planning problem in dynamic environment. In the urban environment, the road environment information is acquired through the vehicle sensor, which is indispensable for path planning and obstacles avoiding. Behavior dynamics method is used for the path planning to generate competition behavior problem, while the particle swarm optimization algorithm is adopted to improve the behavior coordination.

The rest of the paper is as follows: Section 2 introduces behavior dynamics method. The behavior coordination of the standard particle swarm optimization algorithm is introduced in Section 3. Simulation results of illustration examples and discussion are presented in Section 4. Finally, in Section 5, the conclusion and further discussion are given.

2. Behavior Dynamics

The behavior dynamics were included towards the goal of behavior and obstacle avoidance behavior. Using the behavior character of behavior dynamics plan according to the local target from a starting point of a path (namely, the intelligent vehicle navigation path) and satisfying the vehicle in the driveway can avoid the pavement and all sorts of obstacles to the dynamic environment. The heading angle and the path velocity in behavior dynamics model could be represented as the following form [26]:where is position of the intelligent vehicle in the world coordinator system and the parameters are the heading angle and the path velocity of the intelligent vehicle, which generally act as the behavioral variables. and define the rate of the heading angle and velocity as a function of their current values.

2.1. Behavior Dynamics Modeling

The dynamic approach to path generation of the intelligent vehicles employs and as the planning variable [22, 23]. The path planning is continuous in a time course of and ; the target directions relative to the world coordinate system in which target lie from the view of the intelligent vehicle and the obstacle directions in which obstacles lie from the viewpoint of the vehicle relative to the world coordinate system, and , are represented by attractive and repulsive force-lets acting on heading direction (Figure 1). The velocity of target and the velocity of obstacle are constraints that are represented by attractive and repulsive force-lets acting on the path velocity. In the dynamics system, the variables are the direction angle and the path velocity lying at obstacles and target from the current position of the intelligent vehicle shown in Figure 1.

According to the behavior variables and the behavior pattern of the intelligent vehicle, the target and obstacle avoidance of dynamics model is built.

2.1.1. The Target of Behavioral Models

Toward target behavior is the behavior of the intelligent vehicle to reach its destination. The dynamic behavior of the attractor equation is expected with negative slope and asymptotic speed converges to a stable fixed point. The attractors of the equation defined the behavioral variables so that the system is ensured to be at all times in a stable state. The heading angle and the path velocity of the behavior model are established as the following.

(1) Heading Direction Behavior Dynamics Model. In the behavior dynamics model, the heading angle is specified as a time-variant term at any time . is an angle and is cyclic and defined as in the world coordinates, and the -axis is always consistent with the direction of the road. In [24] the heading direction of behavior dynamics for target acquisition can be defined bywhere sets the attraction strength of the vehicle’s heading variable, is the angle between the target and the intelligent vehicle in world coordinate system, and is the attractor in dynamics system. is an attractive force-let and converges to the value so that goes towards the intended target-state. is target position in the world coordinator system and is the time-variant target, and is intelligent vehicle position in the world coordinator system.

(2) The Path Velocity Behavior Dynamics Model. Besides heading direction, in order to ensure the formation and maintenance of the stabilization, path velocity must be adjusted real-time. In terms of path velocity, considering that the security and stability of the vehicle system must meet with safety distance from maximum contact time , is a minimum safe following distance and is the distance to the target. is an attractor of velocity, and goes towards the required velocity . Literature [26, 34, 35] used linear velocity equation, with certain constraints. In this study, [25] is used to define the velocity behavior dynamics the equation towards the target: where is strength factor, is the desired vehicle velocity, and is scope attractors calculated in [36].

2.1.2. Obstacle Avoidance Behavior Model

Obstacle avoidance behavior can be divided into heading direction and velocity behavior.

(1) Heading Direction Behavior Dynamics Model. When the intelligent vehicle is driving in the way of the target road, it is time to avoid the static or moving obstacles on the road to reach the destination safely. is called the repeller, which is unstable point to make the influence of an obstacle go to zero in behavioral dynamics system; defined the behavioral variables. Reference [24] sets the heading direction in the obstacle avoiding behavior using the following equation:where is the repulsion strength, is the distance between the obstacles and intelligent vehicle, which can continuously be estimated using sensory inputs, is the repulsive force of attenuation coefficient with the increase of distance, is the angular scope of the repeller, and is velocity scope of the repeller [36]. This implies that the strength and angular range of the repulsion become stronger as the intelligent vehicle gets closer to obstacles.

Multiple obstacles heading direction of behavior dynamics equation can be written as

(2) The Path Velocity Behavior Dynamics Model. The velocity of the intelligent vehicle is related to the distance between vehicles and obstacles and also to the safety distance . Similar to (3), the path velocity could be modeled as where is velocity to the repeller of velocity intensity factor, the repeller can be changed by adjusting , is the required obstacle velocity, and is scope the repeller calculated in [36].

2.2. Behavior Dynamics Coordination

After the establishment of the various dynamics model, navigation planning demands the fusion of several behavior variants; in practical applications, it is necessary to fuse the behavior various and conduct planning for the vehicle. Consider a fusion of two actions:where are the weight coefficients and behavior of fusion is not considered in literature [36], where four weight coefficients are equal to 1. Thereof, when the target behavior and obstacle avoidance behavior occur simultaneously, two types of behavior lead to a perturbation of the intelligent vehicle. Under the absence of behavior of fusion, the target behavior and obstacle avoidance behavior occur simultaneously, which leads to the perturbation of the vehicle. In order to solve this problem, behavior coordination was studied in depth.

(1) Heading Direction Behavior Fusion. From (7), in the process of driving, it can be seen that there only exists the target behavior with no obstacles in the environment, so , . When obstacles exist in the process of intelligent vehicle driving, obstacle avoidance behavior is stronger than toward the target behavior, so parameters , . When the intelligent vehicle passes through obstacles, the main obstacle avoidance behavior turned toward the target behavior. Similarly, when the vehicle encounters obstacles, the vehicle behavior turns from “toward target” to “obstacle avoidance” along the direction of gradient between the two states, associating with the increasing weight of the obstacle avoidance behavior. Therefore, the vehicle direction perturbations problem arises with the inharmoniousness behavior switching because of the rough coordination.

(2) The Path Velocity Behavior Fusion. Similarly, from (8), when there are no obstacles or the obstacles are static, there is only velocity towards the target behavior: the parameters , . When obstacles are in motion in the process of intelligent vehicle driving, obstacle avoidance behavior is stronger than toward target behavior, the parameters , in (8). When the vehicle is away from obstacles, the velocity of behavior is directed towards the target. Due to the change of behavior, speed behavior alternates from moving towards the target to obstacle avoidance, so that the two behaviors can smooth transition, which will depend on two behaviors of coordination. Otherwise there will be fast or slow phenomenon for the velocity of intelligent vehicle.

3. Particle Swarm Optimization Algorithm

According to many research literatures [32, 33, 35, 39], behavior of competitive dynamics method is used for behavior coordination. Besides the differential form of dynamics equation, the competition dynamics model is still the differential equation and relates to the stability of the system making behavior coordination more complicated. In the literature [38], heading direction angle coefficient of the mobile robot is optimized by genetic algorithm, with the velocity left constant. Reference [39] using particle swarm optimization algorithm, mainly for the interaction between multiple mobile robots for the angle of coordinate, did not consider speed. In this paper, it introduced the behavior from the direction angle and linear velocity at the same time by the particle swarm optimization algorithm to strengthen the problem of the intelligent vehicle navigation path.

3.1. Particle Swarm Optimization Algorithm

The particle swarm optimization algorithm has many advantages such as being easy to describe, adjusting less parameters, and having fast converging speed, so that it has become a hotspot in intelligent optimization and evolution computing once proposed. It has been widely used in the function optimization, dynamic environment optimization, neural network training, and fuzzy system control applications [40].

In PSO, each potential solution to optimization problem is a bird in the search space, called a particle. All particles have a function that is optimized by the decision on the fitness value. Each particle has a speed that decided they fly out of direction and distance, and the optimal particles are to follow the current search in the solution space. Optimization starts to initialize a set of random particles (random solutions) and determines the merits of the solution by the fitness function. Each particle iterative process contains two extremes: the individual extreme and global extreme; individual extreme cognitive level represents particles themselves, and the global extremes represent the social cognitive level; the final optimal solution is obtained after several iterations [40].

The goal of optimizing function search space for -dimensional (namely, the number of optimization variables) is set, the number of particles is , the particle position is , and speed is . The course of the flight in accordance with (7) and (8) to update their own position and speed of the particle. for the individual pbest; for the global gbest:where , , is the number of iterations, is weight coefficient for the particle velocity, and the greater the value of , the better global searching ability for PSO. , are a random number in , and , are limiting factors for acceleration. In iterative process, the particle swarm optimization algorithm has no specific mechanisms to control the velocity of the particles; the speed of the particles to limit the particle speed of each dimension is within ; the position of each dimension is limited within .

3.2. PSO Implementation of Behavior Coordination

Based on the driving characteristics of the intelligent vehicle, at a certain velocity, when the behavior toward the target and obstacle avoidance behavior occurs alternately to reach the destination safely, it becomes a major obstacle avoidance behavior, obstacle avoidance behavior becomes a major behavior and towards the target of behavior will be weakened. When passing through the obstacles, toward the target, behavior becomes dominant. Behavior dynamics analysis through the front, towards the target, and obstacle avoidance behavior including heading direction and the path velocity behavior, the weight coefficient of heading direction, and the path velocity are optimized by particle swarm optimization algorithm, thereby eliminating perturbations; the intelligent vehicle can smoothly move through obstacles to reach the target location.

In this paper, employing the method of PSO, optimization variables are expressed by the particle; the particles set is and . The fitness function reflects the relationship between the intelligent vehicle and the environment. When the obstacle is very close to the intelligent vehicle, the avoidance obstacle behavior plays the leading factor. When the intelligent vehicle is away from object, the target of behavior plays a decisive role; the fitness function is designed as follows:

As proposed in [41], (7) and (8) could be solved by the fourth-order Runge-Kutta method. Besides, are confirmed by the extreme value of fitness function using the particle swarm optimization algorithm.

Similarly, the velocity of behavior of coordination fitness function is

Using the particle swarm optimization algorithm for its function extreme value, can be obtained.

4. The Simulation Analysis

In order to verify the behavior dynamics method as well as behavior coordination algorithm is feasible in the intelligent vehicle path navigation, we carried out the experiment under the condition of the different pavement environment and avoiding obstacle, security requirements like lane keeping, vehicle following, lane changing, and overtaking. Follow these steps to carry out experiment:(1)Establish the system model with unknown parameters of the intelligent vehicle, the sensors, and the road environment. These parameters are all detected by vehicular sensors and used to parameterize corresponding term such as road environment, starting point and target point of the driving, initial velocity and heading direction of the vehicle, position of the obstacles, detecting range and distance of the sensor, and so forth.(2)During the process of driving, obstacles beyond detection scope are according to the behavior dynamics model towards the target for navigation path. When obstacles are detected, there is a use of behavior dynamics of the obstacle avoidance behavior and towards the target behavior of the coordination algorithm for navigation path. The intelligent vehicle in driving, when detecting obstacles outside the safe distance, is according to the dynamics of behavior towards the goal of behavior for navigation path, when detecting obstacles within the safe distance, according to the behavior of dynamic obstacle avoidance behavior and towards the target behavior of the coordination for navigation path.(3)Nonstationary conditions of the vehicle continuously determine the current vehicle position and the target position; stop the iteration after reaching the target; otherwise, repeat (2).

In this paper, MATLAB R2013a simulation experiments, as shown in Figure 1. the simulation parameters: intelligent vehicle initialization parameters for VehiclePos = (initial , coordinates, heading, speed, distance perception, perception range, vehicle size), reference vehicles initialization parameters for VehicleRunPos1 = , the target position initialization parameters for TargetPos = [VehicleRunPos1 (2), VehicleRunPos1 (2)](target and coordinates), the obstacle position initialization parameters for ObstaclePos = [1259022; 2730–6021.5] ( and coordinates of the obstacle heading direction, speed, size of obstacles), perceive the sector range [−30°300°], scene size of ; Particle swarm optimization parameters = = 2, = 0.8, = = , , , , , .

In figure, blue filled circles are an obstacle, red filled circle is detected in the movement of obstacles, black thick line and blue dotted line are for the lane, green rectangle is for intelligent vehicle, blue sector is for intelligent vehicle sensing area, black rectangles are for the target vehicle, and red signs are for intelligent vehicle running track.

The simulation results are shown in Figure 2. In the same scene, two kinds of behavior coordination algorithm optimize the simulation results shown in Figure 2, so the velocity of obstacles behavior weight coefficient is 0, only weight coefficient of heading direction behavior coordination. Figure 2(a) shows running track for PSO behavior coordination in the lane for safe obstacle avoidance and the destination; Figure 2(b) shows running track to Competitive behavior coordination for the lane safe obstacle avoidance and the destination. Figures 2(c) and 2(d) show the intelligent vehicle heading direction variation for PSO behavior coordination and competition behavior coordination. Figures 2(e) and 2(f) show the weight coefficient variation in heading direction for PSO behavior coordination and competition behavior coordination. From the simulation data and diagram it can be seen as in PSO behavior to coordinate the navigation path and heading direction change closer to the actual vehicle characteristics of the vehicle, while the angle change is too large for competitive behavior coordinated. For Figures 2(e) and 2(f) the heading direction of obstacle avoidance and towards the target weight coefficient optimization and the particle swarm optimization method of two parameters optimization more conform to the behavior of the competition law; the particle swarm optimization method is easy to realize in the design, less parameter adjustment, fast convergence, and so on. However, using the method of the differential equation of competition, more parameters are adjusted, making the coordination more complicated.

Figure 3 is the optimization effect of the PSO heading direction and velocity behavior coordination in dynamic obstacles. Figure 3(a) shows PSO behavior coordination to the navigation path of intelligent vehicle, Figures 3(b) and 3(c) show PSO behavior coordination in the heading direction and velocity changes, and Figures 3(d) and 3(e) show the heading direction and velocity of weight coefficient of variation to PSO behavior coordination. Figures 3(a) and 3(b) can be seen as the simulation trajectory and angle change is consistent with the actual vehicle. Figures 3(d) and 3(e) can be seen as heading direction and velocity weight coefficient optimization point of view; PSO weight coefficient is more consistent with the competition behavior change law and can control the intelligent vehicle safe avoidance obstacle, towards the target.

Figure 4 shows lane changing and overtaking using behavior dynamics method and PSO behavior coordination, from running track of the intelligent vehicle, heading direction change, and behavioral weight factors variation law can be seen; behavior dynamics can be well for path planning of the intelligent vehicle.

Simulation results show that behavior dynamics method and PSO behavior coordination can effectively navigate path of the intelligent vehicle for the vehicle follow, lane keeping, lane changing, and overtaking behavior. PSO algorithm solves the obstacle avoidance behavior toward the target behavior coordination due to behavior competition arising perturbations. In the process of driving, at the same time, the change rule of heading direction and driving direction are consistent, and the vehicle’s velocity is adjusted in the process of obstacle avoidance to remain consistent with the actual traffic characteristics.

5. Conclusion

(1) Based on the characteristics of intelligent vehicle driving, combined with behavioral dynamics method, we established method of the navigation path of the intelligent vehicle. The target is the time-variant.

(2) Using PSO algorithm and competition behavior algorithm toward the target and avoidance weight coefficients to optimize shows that PSO algorithm in behavior weight coefficient optimization has advantages: fast convergence and less parameter setting, using behavioral dynamics method to realize the control of the intelligent vehicle for the lateral heading control and the longitudinal velocity control, so that the intelligent vehicle along a desired direction path can pass safely through the obstacles to target position.

In addition, using the behavior dynamics to the navigation path can provide the relevant parameters for the next motion control. Lateral control is concerned with steering the vehicle automatically to follow the reference path. The longitudinal control is concerned with accelerating the vehicle automatically. The variable behavior dynamics is the relation between and the yaw, the relation of longitudinal acceleration. The intelligent vehicle is controlled by using actuators such as the brakes, the accelerator, and the steering wheel so that it adheres to the reference path [42].

(3) The experimental results show that behavioral dynamics method has the real-time performance and reliability, and the PSO algorithm can be a good alternative to the behavior coordination problems.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work is supported by Project (10872160) of the National Natural Science Foundation of China, Shaanxi Province Important Disciplines of the Vehicle Engineering Construction of China, Scientific Research Projects of Shaanxi Province Education Office Key Laboratory (13JS070), and Scientific Research Project in Shaanxi Province Department of Education (14jk1796).

References

  1. M. Hada and T. Tsuji, “A layout design method of human-vehicle systems based on equivalent inertia indices,” Transactions of the Society of Instrument & Control Engineers, vol. 43, no. 5, pp. 400–407, 2007. View at: Publisher Site | Google Scholar
  2. G. K. D. H. Z. C. C. Minglan, “Progress of the human-vehicle closed-loop system manoeuvraility's evaluation and optimization,” Chinese Journal of Mechanical Engineering, vol. 39, pp. 27–35, 2003. View at: Google Scholar
  3. Z. Q. Liu, F. Lian, J. J. Mao, and L. V. Xue, “Research on vehicle stability in driver-vehicle-road closed-loop system,” Vehicle & Power Technology, no. 2, pp. 18–34, 2012. View at: Google Scholar
  4. M. Montemerlo, S. Thrun, H. Dahlkamp, D. Stavens, and S. Strohband, “Winning the DARPA grand challenge with an AI robot,” in Proceedings of the 21st National Conference on Artificial Intelligence (AAAI '06), vol. 1, Boston, Mass, USA, July 2006. View at: Google Scholar
  5. D. Ferguson and A. Stentz, “Field D∗: an interpolation-based path planner and replanner,” in Robotics Research, vol. 28 of Springer Tracts in Advanced Robotics, pp. 239–253, Springer, Berlin, Germany, 2005. View at: Publisher Site | Google Scholar
  6. M. Buehler, K. Iagnemma, and S. Singh, “The 2005 DARPA grand challenge,” in Proceedings of 11th International Symposium on Computational Intelligence in Robotics & Automation (ICARCV '10), pp. 661–692, Singapore, December 2010. View at: Google Scholar
  7. C. Urmson, J. Anhalt, D. Bagnell et al., “Autonomous driving in urban environments: boss and the urban challenge,” Journal of Field Robotics, vol. 25, no. 8, pp. 425–466, 2008. View at: Publisher Site | Google Scholar
  8. M. Montemerlo, J. Becker, S. Shat et al., “Junior: the Stanford entry in the urban challenge,” Journal of Field Robotics, vol. 25, no. 9, pp. 569–597, 2008. View at: Publisher Site | Google Scholar
  9. X.-J. Jing, “Behavior dynamics based motion planning of mobile robots in uncertain dynamic environments,” Robotics & Autonomous Systems, vol. 53, no. 2, pp. 99–123, 2005. View at: Publisher Site | Google Scholar
  10. Y. Kuwata, J. Teo, G. Fiore, S. Karaman, E. Frazzoli, and J. P. How, “Real-time motion planning with applications to autonomous urban driving,” IEEE Transactions on Control Systems Technology, vol. 17, no. 5, pp. 1105–1118, 2009. View at: Publisher Site | Google Scholar
  11. A. T. Rashid, A. A. Ali, M. Frasca, and L. Fortuna, “Path planning with obstacle avoidance based on visibility binary tree algorithm,” Robotics & Autonomous Systems, vol. 61, no. 12, pp. 1440–1449, 2013. View at: Publisher Site | Google Scholar
  12. H. Chen and Z. Xu, “Path planning based on a new genetic algorithm,” in Proceedings of the International Conference on Neural Networks and Brain (ICNN&B '05), pp. 788–792, Beijing, China, October 2005. View at: Google Scholar
  13. M. Gemeinder and M. Gerke, An Active Search Algorithm Extending GA Based Path Planning for Mobile Robot Systems, Springer, London, UK, 2002.
  14. M. A. P. Garcia, O. Montiel, O. Castillo, R. Sepúlveda, and P. Melin, “Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation,” Applied Soft Computing Journal, vol. 9, no. 3, pp. 1102–1110, 2009. View at: Publisher Site | Google Scholar
  15. D. Blum and U. Dortmund, “Ant colony optimization (ACO),” Journal of Interdisciplinary Mathematics, vol. 8, pp. 157–168, 2013. View at: Google Scholar
  16. H. Mo and L. Xu, “Research of biogeography particle swarm optimization for robot path planning,” Neurocomputing, vol. 148, pp. 91–99, 2015. View at: Publisher Site | Google Scholar
  17. L. Lu and D. Gong, “Robot path planning in unknown environments using particle swarm optimization,” in Proceedings of the 4th International Conference on Natural Computation (ICNC '08), pp. 422–426, IEEE, Jinan, China, October 2008. View at: Publisher Site | Google Scholar
  18. J. E. Naranjo, C. González, R. García, and T. De Pedro, “Lane-change fuzzy control in autonomous vehicles for the overtaking maneuver,” IEEE Transactions on Intelligent Transportation Systems, vol. 9, no. 3, pp. 438–450, 2008. View at: Publisher Site | Google Scholar
  19. R. Schubert, K. Schulze, and G. Wanielik, “Situation assessment for automatic lane-change maneuvers,” IEEE Transactions on Intelligent Transportation Systems, vol. 11, no. 3, pp. 607–616, 2010. View at: Publisher Site | Google Scholar
  20. Y. Wang, T. Wei, and X. Qu, “Study of multi-objective fuzzy optimization for path planning,” Chinese Journal of Aeronautics, vol. 25, no. 1, pp. 51–56, 2012. View at: Publisher Site | Google Scholar
  21. M. L. Cummings, J. J. Marquez, and N. Roy, “Human-automated path planning optimization and decision support,” International Journal of Human Computer Studies, vol. 70, no. 2, pp. 116–128, 2012. View at: Publisher Site | Google Scholar
  22. G. Schöner, M. Dose, and C. Engels, “Dynamics of behavior: theory and applications for autonomous robot architectures,” Robotics & Autonomous Systems, vol. 16, no. 2-4, pp. 213–245, 1995. View at: Publisher Site | Google Scholar
  23. A. Steinhage and G. Schoner, “The dynamic approach to autonomous robot navigation,” in Proceedings of the IEEE International Symposium on Industrial Electronics (ISIE '97), vol. 11, pp. S7–S12, Guimaraes, Portugal, July 1997. View at: Publisher Site | Google Scholar
  24. G. Schöner and M. Dose, “A dynamical systems approach to task-level system integration used to plan and control autonomous vehicle motion,” Robotics & Autonomous Systems, vol. 10, no. 4, pp. 253–267, 1992. View at: Publisher Site | Google Scholar
  25. E. Bicho, P. Mallet, and G. Schoner, “Using attractor dynamics to control autonomous vehicle motion,” in Proceedings of the 24th Annual Conference of the IEEE Industrial Electronics Society (IECON '98), vol. 2, pp. 1176–1181, IEEE, Aachen, Germany, August-September 1998. View at: Publisher Site | Google Scholar
  26. S. Monteiro and E. Bicho, “Attractor dynamics approach to formation control: theory and application,” Autonomous Robots, vol. 29, no. 3-4, pp. 331–355, 2010. View at: Publisher Site | Google Scholar
  27. E. Bicho and S. Monteiro, “Formation control for multiple mobile robots: a non-linear attractor dynamics approach,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '03), vol. 2, pp. 2016–2022, October 2003. View at: Publisher Site | Google Scholar
  28. D. Tian, J. Zhou, Y. Wang, G. Zhang, and H. Xia, “An adaptive vehicular epidemic routing method based on attractor selection model,” Ad Hoc Networks, vol. 36, part 2, pp. 465–481, 2016. View at: Publisher Site | Google Scholar
  29. A. C. Hernandes, H. B. Guerrero, M. Becker, J.-S. Jokeit, and G. Schöner, “A comparison between reactive potential fields and Attractor Dynamics,” in Proceedings of the 5th IEEE Colombian Workshop on Circuits and Systems (CWCAS '14), pp. 1–5, IEEE, Bogotá, Colombia, October 2014. View at: Publisher Site | Google Scholar
  30. V. Faria, J. Silva, M. Martins, and C. Santos, “Dynamical system approach for obstacle avoidance in a Smart Walker device,” in Proceedings of the IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC '14), pp. 261–266, IEEE, Espinho, Portugal, May 2014. View at: Publisher Site | Google Scholar
  31. I. Raño and I. Iossifidis, “Modelling human arm motion through the attractor dynamics approach,” in Proceedings of the IEEE International Conference on Robotics and Biomimetics (ROBIO '13), pp. 2088–2093, Shenzhen, China, December 2013. View at: Publisher Site | Google Scholar
  32. F. U. Wei-Ping, P. F. Zhang, and S. Q. Yang, “Behavioral dynamics of mobile robot and rolling windows algorithm to path planning,” Computer Engineering and Applications, vol. 45, pp. 212–214, 2009. View at: Google Scholar
  33. Y. Shiqiang, F. Weiping, and L. Dexin, “Application of dynamic system theory to mobile robot navigation,” Mechanical Science and Technology for Aerospace Engineering, vol. 29, pp. 100–104, 2010. View at: Google Scholar
  34. F. W. H. Dapeng, Y. Shiqiang, and W. Wen, “Study on the navigation method of behavior dynamics in mobile robot,” Mechanical Science and Technology for Aerospace Engineering, vol. 32, no. 10, pp. 1488–1491, 2013. View at: Google Scholar
  35. Y. Lei, Q. Zhu, and Z. Feng, “Dynamic path planning using velocity obstacles and behavior dynamics,” Journal of Huazhong University of Science and Technology, vol. 39, no. 4, pp. 15–19, 2011. View at: Google Scholar
  36. F. W. Han Gaining, H. Dapeng, and W. Wang, “Study on the motion planning method of intelligent vehicle based on the behavior dynamics,” Mechanical Science and Technology for Aerospace Engineering, vol. 34, no. 2, pp. 301–306, 2015. View at: Google Scholar
  37. P. Althaus and H. I. Christensen, “Behavior coordination in structured environments,” Advanced Robotics, vol. 17, no. 7, pp. 657–674, 2003. View at: Publisher Site | Google Scholar
  38. S. Yang, W. Fu, D. Li, and W. Wang, “Research on application of genetic algorithm for intelligent mobile robot navigation based on dynamic approach,” in Proceedings of the IEEE International Conference on Automation and Logistics (ICAL '07), pp. 898–902, IEEE, Jinan, China, August 2007. View at: Publisher Site | Google Scholar
  39. L. Yanmin, Research on dynamic path planning method for multi-robot systems [Ph.D. thesis], Harbin Engineering University, Harbin, China, 2011.
  40. R. Coban, “A fuzzy controller design for nuclear research reactors using the particle swarm optimization algorithm,” Nuclear Engineering & Design, vol. 241, no. 5, pp. 1899–1908, 2011. View at: Publisher Site | Google Scholar
  41. L. Qingyang, Numerical Analysis, Tsinghua University Press, 2008.
  42. G. Tagne, R. Talj, and A. Charara, “Design and validation of a robust immersion and invariance controller for the lateral dynamics of intelligent vehicles,” Control Engineering Practice, vol. 40, pp. 81–92, 2015. View at: Publisher Site | Google Scholar

Copyright © 2016 Gaining Han et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

1223 Views | 647 Downloads | 4 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.