IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i18p3031-d1753442.html
   My bibliography  Save this article

Toward Optimal Multi-Agent Robot and Lift Schedules via Boolean Satisfiability

Author

Listed:
  • Arjo Chakravarty

    (Intrinsic Innovation Singapore Pte Ltd., 3 Fusionopolis Wy, No. 13-21 Symbiosis, Singapore 138633, Singapore
    Engineering Product Development Pillar, Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372, Singapore)

  • Michael X. Grey

    (Intrinsic Innovation Singapore Pte Ltd., 3 Fusionopolis Wy, No. 13-21 Symbiosis, Singapore 138633, Singapore)

  • M. A. Viraj J. Muthugala

    (Engineering Product Development Pillar, Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372, Singapore)

  • Rajesh Mohan Elara

    (Engineering Product Development Pillar, Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372, Singapore)

Abstract

As a multirobot system grows in its number of agents, contention over shared resources poses a more significant risk of deadlock and operational deficiencies. When integrating with buildings, one of the most common pieces of equipment that robots have to use is the lift (elevator). This work focuses on exploring different Anytime Constraint Programming techniques for finding time-optimal schedules across multiple robots and lifts. The choice of which lift each robot uses to complete its task has a noticeable impact on the makespan of the system. This work explores a Time-Ordered-based approach and a Time-Expansion Graph-based approach. The Time-Expansion Graph-based approach is found to outperform the Time-Ordered-based approach. This is because the Time-Expansion Graph method has immediate access to more comprehensive information. Additionally, this paper shows that, in some cases, applying such an optimization can considerably reduce the makespan.

Suggested Citation

  • Arjo Chakravarty & Michael X. Grey & M. A. Viraj J. Muthugala & Rajesh Mohan Elara, 2025. "Toward Optimal Multi-Agent Robot and Lift Schedules via Boolean Satisfiability," Mathematics, MDPI, vol. 13(18), pages 1-17, September.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:18:p:3031-:d:1753442
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/18/3031/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/18/3031/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:18:p:3031-:d:1753442. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.