1998
DOI: 10.1023/a:1008092427865
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2001
2001
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…Canny (1988) demonstrated that the complexity of UAV trajectory planning with flyability is a non-polynomial-hard problem, which means that it is likely to be too computationally demanding for finding the optimal trajectory for non-trivial scenarios (Altendbernd and Hansson 1998) within the required deadline. That deadline can be either a hard real-time condition or a soft real-time condition.…”
Section: Real-time Aspect Of Uav Trajectory Re-planningmentioning
confidence: 99%
“…Canny (1988) demonstrated that the complexity of UAV trajectory planning with flyability is a non-polynomial-hard problem, which means that it is likely to be too computationally demanding for finding the optimal trajectory for non-trivial scenarios (Altendbernd and Hansson 1998) within the required deadline. That deadline can be either a hard real-time condition or a soft real-time condition.…”
Section: Real-time Aspect Of Uav Trajectory Re-planningmentioning
confidence: 99%