Research Article  Open Access
Chaotic Trajectory Design for Monitoring an Arbitrary Number of Specified Locations Using Points of Interest
Abstract
The design of unpredictable trajectories for autonomous patrol robots when accomplishing surveillance missions represents, in many situations, a key desideratum. Solutions to this problem had often been associated with chaotic dynamics. While for area surveillance missions, relevant techniques to produce chaotic motion had been reported, in the case of monitoring a number of precise locations no viable solutions had been proposed. The present paper covers this research gap by offering a complex methodology that involves a mixture of two types of chaotic trajectory segments, based on Lorenz and Chen systems, in obtaining unpredictable trajectories when an arbitrary number of specified locations have to be monitored. The developed pathplanning strategy produces trajectories that can cope efficiently with dynamical degradation of chaos or with obstacle avoidance issues.
1. Introduction
Autonomous mobile robots are intelligent devices that can perform a variety of tasks in unknown and unstructured environments, without explicit human guidance. Their involvement is required anytime difficult, hazardous, or even mundane operations have to be accomplished. Application examples cover a wide range of fields, from domestic floorcleaning [1] to hazardous waste disposal [2] or firefighting operations [3], and are based on a multidisciplinary research effort. One of the most challenging research topics is nevertheless the design of navigation strategies. Starting from an initial military need to develop patrolling trajectories unpredictable for external observers, various researchers employed chaotic dynamics as a means of accomplishment.
Over the last two decades, the chaos theory has spread its applications in a wide variety of areas, from data encryption [4, 5] to random sequence generation [6, 7], biology [8], or mobile autonomous robots. Two basic properties of chaotic systems [9, 10]—sensibility to initial conditions and topological transitivity—are the source of unpredictable trajectories for mobile robots accomplishing area surveillance missions. The solutions found by researchers have the same pattern, which includes two interconnected modules: one for generating the points of the robot’s path using diverse chaotic maps and one that transforms the resulted chaotic pointtopoint trajectory in a kinematic motion of the robot. The first papers that tackled the mentioned problem [11, 12] used the Arnold’s equations to obtain chaotic motion and was followed by other relevant researches, which imply the use of TaylorChirikov map [13, 14], Chua circuit [15, 16], or other relevant chaotic systems [17, 18]. Thus, the mission of patrolling an area with a mobile robot is properly satisfying its major objectives: unpredictability of the trajectory and highquality coverage of the entire terrain.
While all of the mentioned papers are addressing the chaotic surveillance of an area, our work was devoted to solving a slightly different type of problem: the surveillance of a number of specified locations. As a result, the focus of the patrolling mission is switched from an area with no privileged spots to a set of precise locations that must be carefully monitored. In our previous paper [19], we examined the surveillance problem using unpredictable trajectories in the case of an area containing two points of interest. The trajectory was designed using adjusted Lorenz equations, where the two twin equilibrium points had been moved, using a suitable affine transformation, exactly in the location of the two points of interest.
The present paper extends the mentioned approach to an overall methodology by including several new aspects: it generalizes the number of the monitored location; it boosts the unpredictability of the trajectory by introducing synthetic points of interest and by mixing the Lorenztype trajectory segments with Chentype segments. Moreover, the new methodology can efficiently cope with the problem of dynamical degradation of chaos induced either by digital computation or by environment in which the robot navigates.
The rest of the paper is organized as follows. In Section 2, we present the overall methodology for generating chaotic paths based on establishing points of interest inside the investigated area. Section 3 presents the way chaotic trajectory segments are defined based on adjusted Lorenz or Chen systems. In Section 4 some relevant simulation case studies are presented, while Section 5 shows how our methodology solves the inherent problem of dynamical degradation of chaotic properties. Finally, the last section outlines the conclusions and final remarks.
2. Basic Methodology
Basically, there are two types of missions for a patrol robot that may require unpredictable paths: (i) to monitor a specified zone, when the robot has to cover all parts of that area to sense and localize possible events or (ii) to monitor a number of precise locations within an area, when the robot has to discover events only in the proximity of the specified positions. The present paper tackles the second kind of assignment, with the problem being formalized as follows: Problem Formulation: Let us consider a twodimensional Cartesian map in which a mobile robot has to monitor a specified number n of precise locations , with . The task is to design the robot’s path, unpredictable for an external observer, which accomplishes the specified mission.
For solving this problem we exploited a wellknown feature of chaotic systemssensitivity to initial conditions [9, 20, 21]. This characteristic, also known as “butterfly effect,” signifies that arbitrarily small perturbations of a state at any given moment in time lead quickly to significantly diverging states. In the case of a patrol robot, the unpredictability induced by sensitivity to initial conditions [22] is further amplified by two inherent causes: the influence of random noise and the impact of the environment.
Our methodology is based on the Point Of Interest (POI) concept. Generally speaking, a point of interest is a geographically specified location that someone may consider useful or interesting. Two types of POIs are used to design complex chaotic trajectories: (i)real POIs are related to specific spots in the field that have to be carefully monitored(ii)synthetic POIs have no relevance in the field but are chosen either for implementation purposes or for boosting the unpredictability of the path.
In our approach, the patrol robot will have a piecewise chaotic trajectory, where each trajectory section includes a number of Lorenz and Chentype segments generated based on a cell containing only two POIs. Thus, the robot will visit the POIs twobytwo, in a scheduled manner, pursuing a chaotic path.
The complex chaotic trajectory is designed assuming the following steps.
Step 1 (Establishing the POIs). When a patrol robot has the mission to carefully monitor a set of specified locations, the first step in developing a chaotic trajectory based on our methodology is to establish the POIs. While the set of real POIs () match the set of specified locations that will be monitored, the set of synthetic POIs () may be chosen, only if needed, either for implementation reasons or to increase the unpredictability of the trajectory:
The overall set of POIs () includes both real and synthetic POIs:
The methodology is based on the development of chaotic trajectories using two POIs. If we have only one location that needs to be monitored, beside this real POI we will need to add another synthetic POI to meet the requirements of the methodology. Chaotic trajectory design is generalized for an arbitrary number of monitored locations by implying a strategy to switch between different pairs of POIs.
At the end of this step, a map of the area under investigation containing the real and synthetic POIs will be obtained, with respect to a general Cartesian coordinate system.
Step 2 (forming and scheduling the cells containing two POIs). The patrol robot will visit the POIs, previously paired twobytwo in cells, in a scheduled manner. For this, we will construct a set of cells containing two POIs: assuming that By scheduling the elements from , we will form a sequence of cells specifying the order in which the POIs will be visited: where Each has an associated time period, denoted by , which represents the time spent by the mobile robot in that specific cell. Consequently, the sequence of cells (2.5) is strongly connected with a sequence of time periods: In order to carefully monitor the two POIs belonging to a cell, choosing the value has to be related to the robot average speed and to the minimum distance traveled by the robot for an efficient surveillance. This is obviously not a simple task when the trajectory is, like in our case, unpredictable. Based on our simulation analysis, a suitable value for this parameter must satisfy the following experimental formula: where is the Euclidian distance between the two POIs of the cell and is the average speed of the robot.
The pairing of POIs and the schedule for switching from one cell to another must be completed by the human supervisor. This step can be performed in a variety of ways, even using a randomizing procedure in which the cells are formed and scheduled arbitrarily. Besides the use of wellknown chaotic systems in generating the trajectory, an intelligent algorithm for pairing the POIs and scheduling the cells may further improve the unpredictability of the robot’s path for an external observer. To illustrate how the cell forming and scheduling can be done, in Figure 1 we presented an example with five locations that have to be monitored ().
Step 3 (establishing the local cartesian coordinate system inside each cell). At every instant in time, the chaotic trajectory design is governed by two POIs (denoted by and ) that form a cell. Considering the positions of and in the general coordinate system— and —we can establish the local, cell dependant, Cartesian coordinate system in which the mobile robot will evolve using the following procedure: (i) the origin of the local coordinate system will be the midpoint of the segment , or, in global coordinates ; (ii) the horizontal axis () will be along the vector , while the vertical axis () will be constructed in such a way for the new system to be of Cartesian type; (iii) the norm of the unit vector will remain the same as in general Cartesian system. Accordingly, the cellrelated coordinate system will match the one presented in Figure 2, where
Using the mentioned local coordinate system, we can generalize the design of chaotic trajectory segments inside a cell. If we want to find the robot’s path based on the general Cartesian coordinate system (the one related to the entire map of the area under investigation), a combined rotationtranslation transform will be used, based on the following formula:
with
where and are the coordinates of a trajectory point in the local coordinate system, and are the coordinates of the same point in the general coordinate system, and the two POIs, and , that generate the cell will be represented using their general coordinates: and , respectively and .
Based on the schedule adopted in Step 2, the robot passes from a cell to another and the local coordinate system will be modified accordingly.
Step 4 (generating the trajectory segments inside each Cell). By knowing the position of the robot when entering under the influence of a new cell, we can generate the chaotic trajectory segments based on the two POIs and the related local coordinate system. For this, we use two types of dynamical systems, Lorenz and Chen, displaying different classes of chaotic behavior. If the patrol robot has the mission to monitor an area with obstacles, an obstacle avoidance algorithm must be included in our methodology. The design of chaotic trajectory segments for each cell is thoroughly presented in the following section.
3. Design of Chaotic Trajectory Segments
The proposed methodology to design chaotic trajectories implies the use of two types of segments: one that is generated using the Lorenz system and one that is generated using the Chen system.
3.1. Lorenz and Chen Attractors
In an attempt to describe the atmospheric convection for meteorological purposes, Lorenz discovered the first threedimensional autonomous system exhibiting chaotic features [23]: where the standard values for parameters are the Prandl number , the Rayleigh number , and the geometric factor (Figure 3).
The second chaotic attractor used in our methodology was obtained by Chen (Figure 4) exploiting an engineering feedback control method [24]: where the parameters have the following standard values: , , and .
The option to use both Lorenz and Chen attractors in developing chaotic trajectory segments is not random. Our motivation stems from two important facts: (i) the projections of Lorenz and Chen attractors draw chaotic loops around two precise points (Figures 5 and 6), with this observation being the foundation of our methodology and (ii) creating a chain of Lorenz and Chen trajectory segments will increase the unpredictability of the robot’s path due to their different trajectories’ shapes.
In order to thoroughly examine the projections of the two attractors we started from the Vanecek and Celikovsky approach [25] that described both of the systems using the following generalization: where , , , , and for Lorenz attractor and , , , , and for Chen attractor. They demonstrated that the Lorenz and Chen chaotic systems belong to different canonical families [26, 27] based on a condition imposed upon the linear part of (3.3): for Lorenz and for Chen. Thus, the two systems are exhibiting different dynamical behaviors [28, 29], offering a higher degree of unpredictability for trajectories designed by our methodology.
The generalized system (3.3) has three equilibrium points, obtained by equating the time derivatives with zero: In the case of Lorenz attractor, the group of three equilibrium points are , , and , while in the case of Chen attractor are, , and .
The butterflyshaped trajectory developed by Lorenz system (Figure 3) draws two 3D loops around and , having a spiral form of rising amplitude that jumps between the two twin equilibrium points ( and ), at irregular intervals, in an unsystematic manner [30]. Basically, this type of orbit represents an efficient chaotic path to monitor the two equilibrium points, assuring the foundation of our methodology.
In the case of the Chen system, even if the trajectory shape is slightly different (Figure 4), the conclusion is the same: the Chen orbit can efficiently monitor the and equilibrium points.
The way Lorenz and Chen orbits are surveying their twin equilibrium points ( and , resp. and ) is highlighted by the projections of the two attractors presented in Figures 5 and 6.
In order to develop a chaotic monitoring path around the two POIs, and , we have to adapt the Lorenz and Chen systems by moving the projections of their equilibrium points , and , in the POIs locations using affine transformations to preserve their properties.
3.2. Adapted Formulas for Lorenz and Chen Systems
In order to place the two projections of the equilibrium points and symmetrically to the origin, in the required points of interest, and , we have to compute a combined 3D affine transformation that includes a rotation with an angle radians ( is the anticlockwise rotation angle) and a scale transformation:
The modified Lorenz attractor, after applying this affine transformation, becomes where .
In order to place the two projections of Chen’s twin equilibrium points and symmetrically to the origin and to move them in the required points , , we must compute a similar compound 3D affine transformation that includes the same rotation with radians and a scale transformation but with a different scale factor:
Applying the transformation (3.7) to (3.2), the modified Chen attractor is obtained: where .
Using the projections of the attractors described by (3.6) and (3.8) and presented in Figures 7 and 8, we are now able to generate a chaotic trajectory represented by a chain of Lorenz and Chen segments.
4. Patrolling an Area to Monitor a Number of Specified Locations
Starting from the simplest case of monitoring two locations to more complex cases that involve an arbitrary number of monitored locations or the necessity to avoid obstacles, this section particularizes the overall methodology and exemplifies it by Matlab simulations.
4.1. Monitoring Specified Locations in an Area without Obstacles
4.1.1. Area with Two Monitored Locations
An area with two monitored locations is considered to be the simplest case for our methodology, representing the basic foundation from which all other more complex cases are derived. The two monitored locations are the two points of interest used to generate the chain of chaotic segments representing the trajectory.
The sequence of operations is natural and includes (a) the establishment of the local coordinate system; (b) generating the first chaotic segment based on adapted Lorenz system described by (3.6), where the initial point matches the actual robot’s location; (c) after a chosen time interval has elapsed, the robot will stop pursuing the Lorenztype trajectory and will switch to the Chentype trajectory segment formularized by (3.8), where the initial point of this segment matches the last point of Lorenztype segment; and (d) switching back to a Lorenzbased segment when the time interval for pursuing Chentype segment has elapsed and so on. This process is illustrated by Figure 9, where a sequence of four chaotic segments (two Lorenz and two Chentype segments) is developed based on a cell of two POIs ( and ).
4.1.2. Area with an Arbitrary Number of Monitored Locations
When an arbitrary number of monitored locations are considered, we have to design a strategy to allocate real or synthetic POIs and to switch from one pair of POIs to another.
In the case that we have only one imposed location that has to be monitored, we will allocate a synthetic POI and follow the same operations we pursued in the case of two real POIs. Of course, in order to amplify the uncertainty of the trajectory for an outside observer, the location of the synthetic POI can be modified from time to time.
If the mobile robot has to monitor more than two locations, we will start the methodology by allocating POIs to every single monitored location. Supplementary, synthetic POIs may be added for boosting the unpredictability. After pairing the POIs to form the cells, we must develop a strategy to swap between cells. In Figure 10 we presented the Matlab simulation of the chaotic path where the five imposed monitored locations (, , , , and ) are covered using the following strategy: we started with a cell that includes POI1 and POI2 as the POIs to develop chaotic trajectories and, after a while, we switched to the second cell containing POI2 and POI3 (practically we replaced POI1 with POI3, POI2 being kept), and so on until the fourth cell made of POI4 and POI5. After developing chaotic path based on the fifth cell, we can return to the first cell and follow the same procedure.
The related POIs scheduler is obtained easily, using Pseudocode 1.

4.2. Monitoring Precise Locations in an Area with Obstacles
The general case, when the area under investigation contains known or unknown obstacles that can affect the robot’s trajectory, requires the enhancement of our methodology with an obstacle avoidance algorithm.
Obstacle avoidance algorithms are developed to shape the robot’s trajectory toward overcoming unexpected obstacles. The resultant motion depends on the current position of the robot and on the analysis of sensory data. The rich variety of obstacle avoidance algorithms includes the Bug’s algorithm [31] or methods based on artificial potential fields [32], vector field histograms [33], elastic bands [34], or dynamical approaches [35].
In our methodology, we included an obstacle avoidance algorithm that redesigns the Bug’s algorithm to the goal of developing chaotic trajectory. Accordingly, the mobile robot will follow its chaotic trajectory until it encounters an obstacle. In this circumstance the chaotic path will be replaced by an obstacle avoidance trajectory that will contour the obstacle until chaotic motion is again possible. Immediately after the obstacle is left behind, the robot will recompute the chaotic trajectory, based on its current position, to accomplish its mission.
In order to exemplify our methodology in the case of an area with obstacles, we simulated an obstacle avoidance algorithm based on an ultrasonic sensor: when the mobile robot discovers an obstacle within a specified distance, it will rotate to the left until the obstacle disappears from its view (Figure 11). Immediately after this, the robot will return to its chaotic motion.
Enhanced with an obstacle avoidance algorithm, our methodology can accomplish the robot’s mission to monitor defined locations in an area with obstacles pursuing a chaotic trajectory. A Matlab simulation example for the robot’s path developed to monitor two POIs ( and ) in an area with four obstacles is presented in Figure 12.
5. Dealing with the Dynamical Degradation of Chaotic Properties
Chaos degradation is an unwanted and sometimes an inevitable phenomenon [36–38] that can affect practical implementation of chaotic systems. Proficient dealing with this phenomenon requires the discovery of its sources and identifying efficient strategies to cope with it. Two sources of chaos degradation are encountered in the case of patrol robots monitoring an unknown area: (a) finite computing precision and (b) obstacles that prevent the robot from following its chaotic trajectory.
It is generally acknowledged that only an infinite precision implementation can preserve the ideal dynamical properties of chaotic systems. In practice, when chaos is represented digitally, the finite computing precision inevitably leads to the dynamical degradation of chaotic behavior [38–40]. This may turn chaotic trajectories into periodic ones, thus jeopardizing their unpredictability. In order to mitigate the problem of digital degradation of chaos, various solutions have been proposed [4, 41–44]. Our proposed technique solves the problem by leaving the possible periodic trajectory automatically when the preset time to navigate along a Lorenz or Chen chaotic segment expired. This approach is in line with other methodologies that tackled this issue [45, 46].
Besides the digital degradation of chaotic dynamics, another type of chaos degradation may appear: due to the obstacles position in the field, the trajectory can be forced to be periodic. This situation may be solved by our technique, the robot leaving its possible periodic trajectory during the switching from Lorenz to Chentype segment, or vice versa, occurs. To exemplify this situation, in Figure 13 we presented how a chaotic trajectory, developed only by using Lorenz equations, can become periodic with only two strategically placed obstacles blocking the normal chaotic path. By switching to Chentype chaotic segment, the problem will be overcome (Figure 14).
If the problem (periodic trajectory) still persists, we can escape from this situation by adding a synthetic POI and form two new cells that both include this synthetic POI and one of the two original POIs. Moving inside these new cells may reestablish the required chaotic movement.
A special particular case of chaotic degradation that attracted our interest due to its awful consequences is represented by the possibility that the robot’s trajectory ends in one of the equilibrium points of the two chaotic attractors. By equalizing the derivatives in (3.6) and (3.8) with zero, we will obtain the local coordinates of the equilibrium points for the adapted Lorenz system (, , and) and the ones of the modified Chen system (, , and). Because of the two already mentioned reasons of digital computation with finite precision and the obstacle placement in the field, the mobile robot may get stuck in one of these locations for some moments in time in the case of, , and (by switching from Lorenz to Chentype trajectory segments, or vice versa, the robot will start moving again) or indefinitely in case of. The solution that we found to be appropriate in all these cases was to introduce a small jump for the zcoordinate (the one irrelevant for the projection where the robot is moving) (see Pseudocode 2).

By this, the unpredictability of the trajectory is preserved.
6. Conclusions
Autonomous patrol robots are ideal support solutions for different types of reconnaissance and surveillance missions. In this context, the unpredictability of their trajectory for external observers is often considered to be a key issue. This paper presented a novel approach for carefully monitoring a number of specified locations using a path planning methodology that involves the design of trajectory segments based on two chaotic systems with dissimilar dynamics: Lorenz and Chen attractors. The specified locations are visited in a twobytwo scheduled succession that can further improve the unpredictability of the robot motion. Moreover, the methodology offers efficient solutions to cope with maintaining the chaotic behavior when the robot is moving in an area with obstacles or cope with inherent chaotic system dynamics degradation due to the digital computation or to the environment in which the robot evolves.
References
 J. Palacín, J. A. Salse, I. Valganón, and X. Clua, “Building a mobile robot for a floorcleaning operation in domestic environments,” IEEE Transactions on Instrumentation and Measurement, vol. 53, no. 5, pp. 1418–1424, 2004. View at: Publisher Site  Google Scholar
 S. Hedberg, “Robots cleaning up hazardous waste,” AI Expert, vol. 10, no. 5, pp. 20–24, 1995. View at: Google Scholar
 J. D. Setiawan, M. Subchan, and A. Budiyono, “Virtual reality simulation of fire fighting robot dynamic and motion,” in Intelligent Unmanned Systems: Theory and Applications, Studies in Computational Intelligence, Springer, Heidelberg, Germany, 2009. View at: Publisher Site  Google Scholar
 R. HasimotoBeltran, F. AlMasalha, and A. Khokhar, “Performance evaluation of chaotic and conventional encryption on portable and mobile platforms,” ChaosBased Cryptography, vol. 354, pp. 375–395, 2011. View at: Publisher Site  Google Scholar
 H. Liu, X. Y. Wang, and A. Kadir, “Image encryption using DNA complementary rule and chaotic maps,” Applied Soft Computing, vol. 12, no. 5, pp. 1457–1466, 2012. View at: Google Scholar
 W. Xingyuan, Q. Xue, and T. Lin, “A novel true random number generator based on mouse movement and a onedimensional chaotic map,” Mathematical Problems in Engineering, vol. 2012, Article ID 931802, 9 pages, 2012. View at: Publisher Site  Google Scholar
 X. Y. Wang and X. Qin, “A new pseudorandom number generator based on CML and chaotic iteration,” Nonlinear Dynamics, vol. 70, no. 2, pp. 1589–1592, 2012. View at: Google Scholar
 C. A. Brackley, O. Ebenhöh, C. Grebogi et al., “Introduction to focus issue: dynamics in systems biology,” Chaos, vol. 20, no. 4, Article ID 045101, 2010. View at: Publisher Site  Google Scholar
 B. Hasselblatt and A. Katok, A First Course in Dynamics: with a Panorama of Recent Developments, Cambridge University Press, New York, NY, USA, 2003.
 J. He, H. Qian, Y. Zhou, and Z. Li, “Cryptanalysis and improvement of a block cipher based on multiple chaotic systems,” Mathematical Problems in Engineering, vol. 2010, Article ID 590590, 14 pages, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Y. Nakamura and A. Sekiguchi, “Chaotic mobile robot,” IEEE Transaction on Robotics and Automation, vol. 17, no. 6, pp. 898–904, 2001. View at: Google Scholar
 A. Sekiguchi and Y. Nakamura, “The chaotic mobile robot,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '99), vol. 1, pp. 172–178, 1999. View at: Google Scholar
 L. MartinsFilho, E. Macau, R. Rocha, R. Machado, and L. Hirano, “Kinematic control of mobile robots to produce chaotic trajectories,” ABCM Symposium Series in Mechatronics, vol. 2, pp. 258–264, 2006. View at: Google Scholar
 L. S. MartinsFilho and E. E. N. Macau, “Patrol mobile robots and chaotic trajectories,” Mathematical Problems in Engineering, vol. 2007, Article ID 61543, 13 pages, 2007. View at: Publisher Site  Google Scholar
 A. Jansri, K. Klomkarn, and P. Sooraksa, “On comparison of attractors for chaotic mobile robots,” in Proceedings of the 30th Annual Conference of IEEE Industrial Electronics Society (IECON '04), pp. 2536–2541, November 2004. View at: Publisher Site  Google Scholar
 P. Sooraska and K. Klomkarn, “NoCPU chaotic robots: from classroom to commerce,” IEEE Circuits and Systems Magazine, vol. 10, no. 1, pp. 46–53, 2010. View at: Publisher Site  Google Scholar
 C. K. Volos, I. M. Kyprianidis, and I. N. Stouboulos, “A chaotic path planning generator for autonomous mobile robots,” Robotics and Autonomous Systems, vol. 60, no. 4, pp. 651–656, 2012. View at: Google Scholar
 Y. Bae, “Target searching method in the chaotic mobile robot,” in Proceedings of the 23rd IEEE Digital Avionics Systems Conference (DASC ’04), vol. 2, pp. 12.D.7–112.19, Salt Lake City, Utah, USA, October 2004. View at: Google Scholar
 D. I. Curiac and C. Volosencu, “Developing 2D trajectories for monitoring an area with two points of interest,” in Proceedings of the 10th World Scientific and Engineering Academy and Society International Conference on Automation and Information (ICAI '09), pp. 366–369, 2009. View at: Google Scholar
 Z. Liu, “Chaotic time series analysis,” Mathematical Problems in Engineering, vol. 2010, Article ID 720190, 31 pages, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 T. Lin and X. Y. Wang, “A bitlevel image encryption algorithm based on spatiotemporal chaotic system and selfadaptive,” Optics Communications, vol. 285, no. 20, pp. 4048–4054, 2012. View at: Google Scholar
 S. H. Kellert, In the Wake of Chaos: Unpredictable Order in Dynamical Systems, University of Chicago Press, Chicago, Ill, USA, 1993.
 E. N. Lorenz, “Deterministic nonperiodic flow,” Journal of the Atmospheric Sciences, vol. 20, pp. 130–141, 1963. View at: Google Scholar
 G. Chen and T. Ueta, “Yet another chaotic attractor,” International Journal of Bifurcation and Chaos, vol. 9, no. 7, pp. 1465–1466, 1999. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. Vanecek and S. Celikovsky, Control Systems: From Linear Analysis to Synthesis of Chaos, PrenticeHall, London, UK, 1996.
 S. Čelikovský and G. Chen, “On a generalized Lorenz canonical form of chaotic systems,” International Journal of Bifurcation and Chaos, vol. 12, no. 8, pp. 1789–1812, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 J. Lü and G. Chen, “A new chaotic attractor coined,” International Journal of Bifurcation and Chaos, vol. 12, no. 3, pp. 659–661, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 T. Ueta and G. Chen, “Bifurcation analysis of Chen’s attractor,” International Journal of Bifurcation and Chaos, vol. 10, no. 8, pp. 1917–1931, 2000. View at: Google Scholar  Zentralblatt MATH
 J. Lü, T. Zhou, G. Chen, and S. Zhang, “The compound structure of Chen's attractor,” International Journal of Bifurcation and Chaos, vol. 12, no. 4, pp. 855–858, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 A. B. Orue, G. Alvarez, G. Pastor, M. Romera, F. Montoya, and S. Li, “A new parameter determination method for some doublescroll chaotic systems and its applications to chaotic cryptanalysis,” Communications in Nonlinear Science and Numerical Simulation, vol. 15, no. 11, pp. 3471–3483, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 V. J. Lumelsky and T. Skewis, “Incorporating range sensing in the robot navigation function,” IEEE Transactions on Systems, Man and Cybernetics, vol. 20, no. 2, pp. 1058–1068, 1990. View at: Google Scholar
 O. Khatib, “Realtime obstacle avoidance for manipulators and mobile robots,” International Journal of Robotics Research, vol. 5, no. 1, pp. 90–98, 1986. View at: Publisher Site  Google Scholar
 J. Borenstein and Y. Koren, “The vector field histogram—fast obstacle avoidance for mobile robots,” IEEE Transactions on Robotics and Automation, vol. 7, no. 3, pp. 278–288, 1991. View at: Publisher Site  Google Scholar
 S. Quinlan and O. Khatib, “Elastic bands: connecting path planning and control,” in Proceedings of the IEEE International Conference on Robotics and Automation, pp. 802–807, May 1993. View at: Google Scholar
 E. Bicho and G. Schöner, “The dynamic approach to autonomous robotics demonstrated on a lowlevel vehicle platform,” Robotics and Autonomous Systems, vol. 21, no. 1, pp. 23–35, 1997. View at: Google Scholar
 D. I. Curiae, D. Iercan, O. Dranga, F. Dragan, and O. Banias, “Chaosbased cryptography: end of the road?” in Proceedings of the International Conference on Emerging Security Information, Systems, and Technologies (SECURWARE '07), pp. 71–76, Valencia, Spain, October 2007. View at: Publisher Site  Google Scholar
 X. Wang and L. Teng, “An image blocks encryption algorithm based on spatiotemporal chaos,” Nonlinear Dynamics, vol. 67, no. 1, pp. 365–371, 2012. View at: Publisher Site  Google Scholar
 S. Li, G. Chen, and X. Mou, “On the dynamical degradation of digital piecewise linear chaotic maps,” International Journal of Bifurcation and Chaos, vol. 15, no. 10, pp. 3119–3151, 2005. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. Li, X. Mou, Y. Cai, Z. Ji, and J. Zhang, “On the security of a chaotic encryption scheme: problems with computerized chaos in finite computing precision,” Computer Physics Communications, vol. 153, no. 1, pp. 52–58, 2003. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 X. Y. Wang and Y. X. Xie, “A design of pseudorandom bit generator based on single chaotic system,” International Journal of Modern Physics C, vol. 23, no. 3, Article ID 1250024, 2012. View at: Google Scholar
 D. D. Wheeler and R. A. J. Matthews, “Supercomputer investigations of a chaotic encryption algorithm,” Cryptologia, vol. 15, no. 2, pp. 140–151, 1991. View at: Google Scholar
 G. Heidaribateni and C. D. McGillem, “Chaotic directsequence spreadspectrum communication system,” IEEE Transactions on Communications, vol. 42, no. 234, pp. 1524–1527, 1994. View at: Google Scholar
 T. Sang, R. Wang, and Y. Yan, “Perturbancebased algorithm to expand cycle length of chaotic key stream,” Electronics Letters, vol. 34, no. 9, pp. 873–874, 1998. View at: Google Scholar
 H. Liu and X. Y. Wang, “Color image encryption using spatial bitlevel permutation and highdimension chaotic system,” Optics Communications, vol. 284, no. 1617, pp. 3895–3903, 2011. View at: Publisher Site  Google Scholar
 X. Wu and Z. Wang, “An autoswitched chaos system,” Procedia Engineering, vol. 24, pp. 464–469, 2011. View at: Google Scholar
 Y. Wang, X. Liao, T. Xiang, K. W. Wong, and D. Yang, “Cryptanalysis and improvement on a block cryptosystem based on iteration a chaotic map,” Physics Letters A, vol. 363, no. 4, pp. 277–281, 2007. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2012 DanielIoan Curiac and Constantin Volosencu. 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.