How anirudh-swaminathan/3d_euclidean_planning works
Project type and purpose
• This is a command-line motion-planning tool (not a web/full-stack app) written in Python for 3D continuous‐space path planning.
• It implements multiple planners (A*, greedy, greedy with collision checking, RRT* via OMPL) on predefined 3D maps with AABB obstacles, producing both visualization images and numeric path‐quality properties.
File structure
• Top‐level files:
• requirements.txt, README.md, LICENSE → project metadata & dependencies
• src/ → all source code, inputs, and outputs
• src/ contains:
• main_*.py files – entry points for each algorithm (main_astar.py, main_greedy.py, main_collision.py, main_ompl.py, plus final alias main.py)
• Planner.py – definitions of A*, greedy, and greedy‐collision planners
• OMPLPlanner.py – adapter for OMPL RRT* implementation
• maps/ – input environment definitions
• path_images/ – output images per algorithm/per map
• path_properties/ – numeric output (path lengths, node counts) per algorithm/per map
README for additional insights
• Confirms core algorithms and their organization
• Describes how inputs map → planner → outputs images + properties
• Notes external dependency on OMPL (Python bindings) and pyrr for collision checking