Multitasking collision-free optimal motion planning algorithms in Euclidean spaces (2020)
Source: Discrete Mathematics, Algorithms and Applications. Unidade: ICMC
Subjects: ESPAÇOS FIBRADOS, HOMOTOPIA, ROBÓTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ZAPATA, Cesar Augusto Ipanaque e GONZÁLEZ, Jesús. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces. Discrete Mathematics, Algorithms and Applications, v. 12, n. 3, p. 2050040-1-2050040-19, 2020Tradução . . Disponível em: https://doi.org/10.1142/S1793830920500408. Acesso em: 08 out. 2024.APA
Zapata, C. A. I., & González, J. (2020). Multitasking collision-free optimal motion planning algorithms in Euclidean spaces. Discrete Mathematics, Algorithms and Applications, 12( 3), 2050040-1-2050040-19. doi:10.1142/S1793830920500408NLM
Zapata CAI, González J. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces [Internet]. Discrete Mathematics, Algorithms and Applications. 2020 ; 12( 3): 2050040-1-2050040-19.[citado 2024 out. 08 ] Available from: https://doi.org/10.1142/S1793830920500408Vancouver
Zapata CAI, González J. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces [Internet]. Discrete Mathematics, Algorithms and Applications. 2020 ; 12( 3): 2050040-1-2050040-19.[citado 2024 out. 08 ] Available from: https://doi.org/10.1142/S1793830920500408