Max Robotics — Global Service Robot Directory + US Certification

About

Bradford Heap is an Australian robotics and artificial intelligence researcher whose work centers on multi-robot task allocation (MRTA), auction-based coordination algorithms, and autonomous systems. Over the course of more than a decade, Heap has made sustained contributions to solving one of robotics' most challenging combinatorial problems: efficiently assigning dynamic tasks — including pickup and delivery operations — across teams of robots in real-world environments. His most influential work introduces and refines sequential single-cluster auction algorithms, demonstrating how clustering and repeated auctioning can yield practical, scalable solutions for MRTA problems. His 2013 paper on repeated sequential single-cluster auctions with dynamic tasks has garnered 17 citations, becoming a key reference in the field. Heap has also addressed fault tolerance, proposing reallocation strategies when individual robots fail mid-mission, and tackled scheduling dependencies by developing novel task-cost dispersion metrics to minimize undesirable high-cost assignments. Collectively, his publications have accumulated over 48 citations, reflecting meaningful engagement from the robotics research community. Heap's body of work offers both theoretical grounding and practical algorithmic tools, making it particularly valuable for researchers and students working on autonomous multi-agent coordination and warehouse robotics applications.