74 citations · 143 across the 14 of their papers we have counts for
16 papers
Modular Reinforcement Learning For Cooperative Swarms
Erel Shtossel, Gal A. Kaminka
A cooperative robot swarm is a collective of computationally-limited robots that share a common goal. Each robot can only interact with a small subset of its peers, without knowing…
A Harmonic Mean Formulation of Average Reward Reinforcement Learning in SMDPs
Erel Shtossel, Alicia Vidler, Uri Shaham +1
Recent research has revived and amplified interest in algorithms for undiscounted average reward reinforcement learning in infinite-horizon, non-episodic (continuing) tasks. Semi-M…
A Language for Describing Agentic LLM Contexts
Noga Peleg Pelc, Gal A. Kaminka, Yoav Goldberg
Large language models are increasingly used within larger systems ("LLM agents"). These make a sequence of LLM calls, each call providing the LLM with a combination of instructions…
Personalized Medication Planning via Direct Domain Modeling and LLM-Generated Heuristics
Yonatan Vernik, Alexander Tuisov, David Izhaki +3
Personalized medication planning involves selecting medications and determining a dosing schedule to achieve medical goals specific to each individual patient. Previous work succes…
Multiagent Reinforcement Learning for Liquidity Games
Alicia Vidler, Gal A. Kaminka
Making use of swarm methods in financial market modeling of liquidity, and techniques from financial analysis in swarm analysis, holds the potential to advance both research areas.…
Bugs with Features: Vision-Based Fault-Tolerant Collective Motion Inspired by Nature
Peleg Shefi, Amir Ayali, Gal A. Kaminka
In collective motion, perceptually-limited individuals move in an ordered manner, without centralized control. The perception of each individual is highly localized, as is its abil…
Tightest Admissible Shortest Path
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its com…
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized fram…
Rivendell: Project-Based Academic Search Engine
Teddy Lazebnik, Hanna Weitman, Yoav Goldberg +1
Finding relevant research literature in online databases is a familiar challenge to all researchers. General search approaches trying to tackle this challenge fall into two groups:…
Position Paper: Online Modeling for Offline Planning
Eyal Weiss, Gal A. Kaminka
The definition and representation of planning problems is at the heart of AI planning research. A key part is the representation of action models. Decades of advances improving dec…
Planning with Dynamically Estimated Action Costs
Eyal Weiss, Gal A. Kaminka
Information about action costs is critical for real-world AI planning applications. Rather than rely solely on declarative action models, recent approaches also use black-box exter…
Heuristic Online Goal Recognition in Continuous Domains
Mor Vered, Gal A. Kaminka
Goal recognition is the problem of inferring the goal of an agent, based on its observed actions. An inspiring approach - plan recognition by planning (PRP) - uses off-the-shelf pl…
Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent
Noa Agmon, Gal A. Kaminka, Sarit Kraus
The problem of adversarial multi-robot patrol has gained interest in recent years, mainly due to its immediate relevance to various security applications. In this problem, robots a…
Representing Conversations for Scalable Overhearing
G. Gutnik, G. A. Kaminka
Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent co…
Monitoring Teams by Overhearing: A Multi-Agent Plan-Recognition Approach
G. A. Kaminka, D. V. Pynadath, M. Tambe
Recent years are seeing an increasing need for on-line monitoring of teams of cooperating agents, e.g., for visualization, or performance tracking. However, in monitoring deployed…
Robust Agent Teams via Socially-Attentive Monitoring
G. A. Kaminka, M. Tambe
Agents in dynamic multi-agent environments must monitor their peers to execute individual and group plans. A key open question is how much monitoring of other agents' states is req…