2012
DOI: 10.1155/2012/940276
|View full text |Cite
|
Sign up to set email alerts
|

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 tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 44 publications
0
8
0
Order By: Relevance
“…The size of the key space depends not only on the number of keys, but also on the number of possible values for each key. The problem of numerical chaotic systems is that the finite precision of the machines (e.g., computers) leads to performance degradation [31][32][33][34], such as: the key space is reduced, some weak keys appear, and the randomness of the sequence is reduced. In order to identify and avoid weak keys, we need to calculate the Lyapunov exponents of chaotic systems, or plot the phase space trajectories of the system.…”
Section: Key Spacementioning
confidence: 99%
“…The size of the key space depends not only on the number of keys, but also on the number of possible values for each key. The problem of numerical chaotic systems is that the finite precision of the machines (e.g., computers) leads to performance degradation [31][32][33][34], such as: the key space is reduced, some weak keys appear, and the randomness of the sequence is reduced. In order to identify and avoid weak keys, we need to calculate the Lyapunov exponents of chaotic systems, or plot the phase space trajectories of the system.…”
Section: Key Spacementioning
confidence: 99%
“…A general problem concerning the use of chaotic systems in encryption is given by References [25][26][27][28] when chaotic systems are implemented on finite precision machines (e.g., computers). The impact of this problem on the proposed encryption scheme is mainly to narrow for the key space.…”
Section: Key Space Analysismentioning
confidence: 99%
“…The size of the key space depends not only on the number of keys but also on the number of possible values for each key. The problem of numerical chaotic systems is that the finite precision of the machines (e.g., computers) leads to performance degradation [63][64][65][66], such as the key space is reduced, some weak keys appear, and the randomness of the sequence is reduced. In order to identify and avoid weak keys, we need to calculate the Lyaponuv exponents of chaotic systems or plot the phase space trajectories of the system.…”
Section: Key Space Analysesmentioning
confidence: 99%