Dynamic Curvature Constrained Path Planning
<|reference_start|>Dynamic Curvature Constrained Path Planning: Effective path planning is a pivotal challenge across various domains, from robotics to logistics and beyond. This research is centred on the development and evaluation of the Dynamic Curvature-Constrained Path Planning Algorithm (DCCPPA) within two dimensional space. DCCPPA is designed to navigate constrained environments, optimising path solutions while accommodating curvature constraints.The study goes beyond algorithm development and conducts a comparative analysis with two established path planning methodologies: Rapidly Exploring Random Trees (RRT) and Probabilistic Roadmaps (PRM). These comparisons provide insights into the performance and adaptability of path planning algorithms across a range of applications.This research underscores the versatility of DCCPPA as a path planning algorithm tailored for 2D space, demonstrating its potential for addressing real-world path planning challenges across various domains. Index Terms Path Planning, PRM, RRT, Optimal Path, 2D Path Planning.<|reference_end|>
@article{myadam2024dynamic,
    title={Dynamic Curvature Constrained Path Planning},
    author={Nishkal Gupta Myadam},
    journal={arXiv preprint arXiv:2410.03253},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.03253},
    primaryClass={cs.RO}
}