<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=185076"><dc:title>Warehouse path planning using low-order Bézier curves with minimum-time optimization</dc:title><dc:creator>Blažič,	Sašo	(Avtor)
	</dc:creator><dc:creator>Klančar,	Gregor	(Avtor)
	</dc:creator><dc:creator>Benko Loknar,	Martina	(Avtor)
	</dc:creator><dc:creator>Škrjanc,	Igor	(Avtor)
	</dc:creator><dc:subject>path planning</dc:subject><dc:subject>motion primitives</dc:subject><dc:subject>Bezier curve</dc:subject><dc:subject>continuous curvature</dc:subject><dc:subject>minimal time</dc:subject><dc:subject>warehouse</dc:subject><dc:description>In this paper, low-order Bézier motion primitives are proposed for motion planning in corridor-constrained spaces, which is illustrated on a warehouse application. The proposed primitives are easily computed for given requirements (initial and final position, orientation and curvature). A new parametrization of the motion primitives is provided which allows an intuitive geometric interpretation. The combined path constructed from these primitives has a minimal number of turns, as third-order Bezier curves are used. At the same time, the combined path has continuous curvature. A path planning approach is proposed that finds the optimal combination of primitives that results in a minimum travel time while satisfying constraints on velocity, acceleration, and free space. To illustrate the applicability of the approach, a comparison with a typical predefined warehouse path and an existing advanced optimisation planner is provided and evaluated.</dc:description><dc:date>2023</dc:date><dc:date>2026-07-22 09:40:52</dc:date><dc:type>Neznano</dc:type><dc:identifier>185076</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
