Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams حسب Eduardo Feo-Flushing (23276023)

"…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …"

MoveSchedule حسب Zouein, Pierette

"…The timing of these needs is inferred from the activity schedule. The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل