Computing the Minimum-Time Interception of a Moving Target
Abstract
References
Index Terms
- Computing the Minimum-Time Interception of a Moving Target
Recommendations
Always convergent iteration methods for nonlinear equations of Lipschitz functions
We define a class of always convergent methods for solving nonlinear equations of real Lipschitz functions. These methods generate monotone iterations that either converge to the nearest zero, if exists or leave the interval in a finite number of steps. ...
Adaptive Dynamic Path Planning Algorithm for Interception of a Moving Target
Most of the 3D curve path planning is used to build static path planning. For intercepting of a moving target, the path planning has to be set in a dynamic condition. L+Dumo algorithm which is based on curve is used to intercept a moving target. In the ...
Minimum-time lateral interception of a moving target by a Dubins car
AbstractThis paper presents the problem of lateral interception by a Dubins car of a target that moves along an a priori known trajectory. This trajectory is given by two coordinates of a planar location and one angle of a heading orientation, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Plenum Press
United States
Publication History
Author Tags
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0