Collaborative and Non-Collaborative Dynamic Path Prediction Algorithm for Mobile Agents Collision Detection with Dynamic Obstacles in 3D Space

Babovic, Elmir

doi:10.1007/978-1-4614-3535-8_9

Cited by 2 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Term behavior is used [27] and VSTR [28] algorithm for collision avoiding is one of the solutions. This algorithm is based on algorithm and concept presented in [29] and [30] by the author of this research.…”

Section: Recent Developments and Research Backgrounmentioning

confidence: 99%

“…The algorithm [29] [30] is based on method recently developed which uses statistical methods for calculation of future mobile agent's paths. This is achieved by measuring coordinates every time period t n which is collaboratively determined in system setup based on average speed and mobile agents physical and technical characteristics and agility.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Coefficient of agility and sampling frequency issues in Mobile Agents Collision Detection with Dynamic Obstacles in 3D Space

Babovic

2012

2012 12th IEEE International Workshop on Advanced Motion Control (AMC)

Self Cite

View full text Add to dashboard Cite

This research is extension of previous research on method of Collaborative and Non-Collaborative Dynamic Path Prediction Algorithm for Mobile Agents Collision Detection withDynamic Obstacles in 3D Space. In this research the extension of the algorithm for dynamic collaborative path prediction for mobile agents is proposed and two important issues Coefficient of agility and Minimal sampling frequency are analyzed. Those two terms are proposed in previous research for which background and introduction is explained in this paper. Solving Coefficient of agility and minimal sampling frequency issues allows system designers and developers to implement the method. This method allows full decentralization of collision detection which allows many advantages from minimizing of network traffic to simplifying of inclusion of additional agents in relevant space. Implementation of the algorithm will be low resource consuming allowing mobile agents to free resources for additional tasks.

show abstract

Section: Recent Developments and Research Backgrounmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%