← Search

Jannik Abbenseth

1 accepted papers

2019

An Optimal Algorithm to Solve the Combined Task Allocation and Path Finding Problem

IROS 2019poster

We consider multi-agent transport task problems where, e.g. in a factory setting, items have to be delivered from a given start to a goal pose while the delivering robots need to avoid collisions with each other on the floor.We introduce a Task Conflict-Based Search (TCBS) Algorithm to solve the com…

Cited by 51SourceScholar