All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Integrating Late Variable Binding with SP-MCTS for Efficient Plan Execution in BDI Agents

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F26%3A0193742" target="_blank" >RIV/00216305:26230/26:0193742 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.fit.vut.cz/research/publication/13326/" target="_blank" >https://www.fit.vut.cz/research/publication/13326/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0013373900003890" target="_blank" >10.5220/0013373900003890</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Integrating Late Variable Binding with SP-MCTS for Efficient Plan Execution in BDI Agents

  • Original language description

    This paper investigates the Late binding strategy as an enhancement to the SP-MCTS algorithm for intention selection and variable binding in BDI (Belief-Desire-Intention) agents. Unlike the Early binding strategy, which selects variable substitutions prematurely, Late binding defers these decisions until necessary, aggregating all substitutions for a plan into a single node. This approach reduces the search tree size and enhances adaptability in dynamic environments by maintaining flexibility during plan execution. We implemented the Late binding strategy within the FRAg system to validate our approach and conducted experiments in a static maze task environment. Experimental results demonstrate that the Late binding strategy consistently outperforms Early binding, achieving up to 150% higher rewards, particularly for the lowest parameter values of the SP-MCTS algorithm in resource-constrained scenarios. These results confirm that it is feasible to integrate Late binding into intention selection methods, opening opportunities to explore its use in approaches with lower computational demands than the SP-MCTS algorithm.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART

  • ISBN

    978-989-758-737-5

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    679-686

  • Publisher name

    SciTePress - Science and Technology Publications

  • Place of publication

    Porto

  • Event location

    Porto

  • Event date

    Feb 23, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article