Buscar
Mostrando ítems 1-2 de 2
Ponencia
Solving the feasibility problem in robotic motion planning by means of Enzymatic Numerical P systems
(IMCS: International Membrane Computing Society, 2019)
Solving the feasibility problem in robotic motion planning means to find feasible trajectories for specific mobile robots acting in environments with obstacles whose positions are known a priori. The Rapidly-exploring ...
Artículo
A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning
(IOS Press, 2020)
In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random ...