Search Results - "Time-varying nonlinear programming problem"

Path planning for multiple mobile robots under double-warehouse by Ma, Yong, Wang, Hongwei, Xie, Yong, Guo, Min

“… Within each warehouse, the polynomial based paths are subject to constraints such as motion boundaries, kinematics constraints, obstacle-avoidance, limited resource of elevators and smoothness…”
Get full text

A novel approach for multiple mobile objects path planning: Parametrization method and conflict resolution strategy by Ma, Yong, Wang, Hongwei, Zamirian, M.

“… This problem is formulated as calculus of variation problem (CVP). Using parametrization method, CVP is converted to time-varying nonlinear programming problems (TNLPP) and then resolved…”
Get full text