Linear assignment problem with voxelized constraints

In this thesis, the classical linear assignment problem (LAP) will be evaluated under additional constraints in the context of earthmoving. These constraints concern positional requirements that must be satisfied when moving soil volume-elements (voxels). For instance, the earthmoving activity cannot access voxels that are surrounded by other voxels. These inaccessible voxels can only be moved after some of its neighbors have been removed. Traditional LAP methods alone are insufficient to solve this problem due to these accessibility constraints. This thesis is about alternative methods and algorithms that tackle the class of problems resulting from this application. Methods to attain robust solutions against perturbations in the quantitative parameters that are a part of the proposed solution will be outlined at the end of this thesis. The results of this thesis are intended to be used in construction operations where flattening large terrain or meticulous excavating is required.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Industrial Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2022

Author dc:creator

• Fouani, Rami

Contributors dc:contributor

• Sreenivas, Ramavarapu S

• linear assignment problem
• Murty
• excavation
• voxels
• optimization
• linear programming

Statement dc:rights

• Copyright 2022 Rami Fouani

Language dc:language

en, eng

Handle dc:identifier

https://hdl.handle.net/2142/116104

OAI record oai:identifier

https://www.ideals.illinois.edu/oai-pmh?verb=GetRecord&metadataPrefix=etdms&identifier=oai%3Awww.ideals.illinois.edu%3A2142%2F116104