APF: fast network all-pair reachability calculation
Abstract
References
Recommendations
DBVS-APF-RRT*: A global path planning algorithm with ultra-high speed generation of initial paths and high optimal path quality
AbstractDuring the last decade, RRT* algorithm has been widely concerned by researchers because of its asymptotic optimality. However, the slow convergence rate of the RRT* algorithm leads to poor quality of the optimal paths at small number of ...
Highlights- A DBVS sampling strategy is proposed to find the initial path with ultra-high speed.
- Global random sampling and key region sampling are added to improve path quality.
- APF algorithm is combined to improve obstacle avoidance ability ...
Transition predicate abstraction and fair termination
POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPredicate abstraction is the basis of many program verification tools. Until now, the only known way to overcome the inherent limitation of predicate abstraction to safety properties was to manually annotate the finite-state abstraction of a program. We ...
Analysis and effective controller design for the cascaded H-bridge multilevel APF with adaptive signal processing algorithms
The cascaded H-bridge (CHB) multilevel inverter is being recognized as the most suitable topology for high-power medium-voltage power quality conditioning applications. This paper presents mathematical modeling and effective controller design ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/829992e1-f8b8-41a5-9f22-604f15a6be90/3230718.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 92Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in