2024
DOI: 10.1016/j.jksuci.2023.101909
|View full text |Cite
|
Sign up to set email alerts
|

Modeling UAV swarm flight trajectories using Rapidly-exploring Random Tree algorithm

Jan M. Kelner,
Wojciech Burzynski,
Wojciech Stecz
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…The other matrices in (7) denote the following: A(q) is a constraint matrix, B is a friction coefficient matrix, and E is a matrix related to the wheel torques:…”
Section: M(q)mentioning
confidence: 99%
See 1 more Smart Citation
“…The other matrices in (7) denote the following: A(q) is a constraint matrix, B is a friction coefficient matrix, and E is a matrix related to the wheel torques:…”
Section: M(q)mentioning
confidence: 99%
“…Airport UGVs should continuously ensure a precise assessment of the load-bearing capacity of natural airport surfaces in a continuous way. This specific type of surface occurs at airports and airstrips for private, civil, and military use [6,7]. Routine inspection and maintenance of pavement surfaces are of the utmost importance, especially for runway strips designed for aircraft takeoff and landing at significantly higher speeds.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the problem of UAV path planning can be regarded as a complex optimization problem that requires effective algorithms to solve. For the problem of UAV path planning, researchers have proposed many methods to solve it, such as traditional methods such as the artificial potential field algorithm [26], Rapidly-exploring Random Tree (RRT) [27], and neural network algorithms [28], as well as emerging reinforcement learning algorithms such as the Q-learning algorithm [29]. However, these methods require a large amount of computing time and resources.…”
Section: Related Workmentioning
confidence: 99%
“…This is a result of restrictions in both the UAV and the outside environment. For example, Kelner et al [26] used the rapidly exploring random tree algorithm to solve UAV path planning problems. They treated the flight path's beginning as the search tree's root node and chose nearby nodes that met both constraint limits and had the lowest possible cost to include in the search tree.…”
Section: Relate Workmentioning
confidence: 99%