Picture for Enrico Saccon

Enrico Saccon

Department of Information Engineering and Computer Science, Università di Trento, Trento, Italy

Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature

Add code
Sep 15, 2024
Figure 1 for Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature
Figure 2 for Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature
Figure 3 for Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature
Figure 4 for Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature
Viaarxiv icon

When Prolog meets generative models: a new approach for managing knowledge and planning in robotic applications

Add code
Sep 26, 2023
Figure 1 for When Prolog meets generative models: a new approach for managing knowledge and planning in robotic applications
Figure 2 for When Prolog meets generative models: a new approach for managing knowledge and planning in robotic applications
Figure 3 for When Prolog meets generative models: a new approach for managing knowledge and planning in robotic applications
Figure 4 for When Prolog meets generative models: a new approach for managing knowledge and planning in robotic applications
Viaarxiv icon