Abstract
AbstractA nonlinear cooperative control problem involving several vehicles is detailed and solved. The vehicles must be assigned to perform many tasks such that they obey constraints on the order of task completion and minimize a nonlinear objective function, the total time to finish all tasks. This is an example of a combinatorial task assignment problem. A novel heuristic is introduced that represents a new combination of two combinatorial optimization tools. The quality of the solutions produced by this heuristic is demonstrated through comparison with a branch and bound search method. The branch and bound method is a well‐known procedure and finds optimal solutions to the constrained, nonlinear task assignment problem. Copyright © 2011 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
