7 accepted papers
Autonomous exploration in complex environments is frequently hindered by inefficient back-and-forth movements and repetitive revisits to previously explored areas. To address these drawbacks, we propose a two-mode hybrid dynamic exploration strategy that detects isolated frontier clusters and adapti…
This position paper argues that reinforcement learning (RL) should be used to *adjust* foundation models after pretraining and cold-start supervision, not *abused* as a default recipe for capability creation or early-stage training. We view RL as a high-cost, high-leverage post-training operator tha…
Many optimization tasks involve streaming data with unknown concept drifts, posing a significant challenge as Streaming Data-Driven Optimization (SDDO). Existing methods, while leveraging surrogate model approximation and historical knowledge transfer, are often under restrictive assumptions such as
While reasoning over long context is crucial for various real-world applications, it remains challenging for large language models (LLMs) as they suffer from performance degradation as the context length grows. Recent work MemAgent has tried to tackle this by processing context chunk-by-chunk in an …
Multi-Agent Path Finding (MAPF) focuses on navigating agents along cost-efficient and conflict-free paths. This letter investigates a challenging and practical MAPF variant, namely Robust Lifelong MAPF (RLMAPF), where agents sequentially receive tasks and effectively deal with uncertainties. In this
Large Language Models (LLMs) have significantly advanced legal intelligence, but the scarcity of scenario data impedes the progress toward interactive legal scenarios. This paper introduces a Multi-agent Legal Simulation Driver (MASER) to scalably generate synthetic data by simulating interactive le…
Multi-Agent Path Finding (MAPF) aims at finding a set of conflict-free and cost-optimal paths for agents from pickup to delivery locations. Most existing MAPF research focus on exhaustively search for path set for the agents with conflict-free paths, which often results in high computational costs.