On the public citation graph

Distributed Heuristic Forward Search for Multi-agent Planning

0 signed · 125 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11787006_1openalex-snapshot
Differential Privacy
inferredcites →https://doi.org/10.1007/11872283_9openalex-snapshot
Framework and Complexity Results for Coordinating Non-cooperative Planning Agents
inferredcites →https://doi.org/10.1007/3-540-46135-3_26openalex-snapshot
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/s10458-006-5951-yopenalex-snapshot
Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications
inferredcites →https://doi.org/10.1007/s10489-014-0540-2openalex-snapshot
FMAP: Distributed cooperative multi-agent planning
inferredcites →https://doi.org/10.1007/s10489-019-01429-0openalex-snapshot
Plan merging by reuse for multi-agent planning
inferredcites →https://doi.org/10.1016/0004-3702(84)90003-1openalex-snapshot
A heuristic search algorithm with modifiable estimate
inferredcites →https://doi.org/10.1016/j.artint.2006.11.005openalex-snapshot
Learning action models from plan examples using weighted MAX-SAT
inferredcites →https://doi.org/10.1016/s0004-3702(01)00106-0openalex-snapshot
LAO∗: A heuristic search algorithm that finds solutions with loops
inferredcites →https://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1023/a:1018924209812openalex-snapshot
A heuristic technique for multi‐agent planning
inferredcites →https://doi.org/10.1080/09528130110063074openalex-snapshot
Parallel planning via the distribution of operators
inferredcites →https://doi.org/10.1109/21.135689openalex-snapshot
Multistage negotiation for distributed constraint satisfaction
inferredcites →https://doi.org/10.1109/69.729707openalex-snapshot
The distributed constraint satisfaction problem: formalization and algorithms
inferredcites →https://doi.org/10.1109/cdc.2009.5400084openalex-snapshot
Distributed optimal planning: an approach by weighted automata calculus
inferredcites →https://doi.org/10.1109/cse.2009.169openalex-snapshot
Privacy-Preserving Multi-agent Constraint Satisfaction
inferredcites →https://doi.org/10.1109/iat.2004.1343012openalex-snapshot
Distributed constraint satisfaction and optimization with privacy enforcement
inferredcites →https://doi.org/10.1109/iat.2004.51openalex-snapshot
Distributed constraint satisfaction and optimization with privacy enforcement
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1111/j.0824-7935.2004.00238.xopenalex-snapshot
Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality
inferredcites →https://doi.org/10.1145/1082473.1082599openalex-snapshot
An efficient algorithm for multiagent plan coordination
inferredcites →https://doi.org/10.1145/1329125.1329333openalex-snapshot
SSDPOP
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/2390231.2390238openalex-snapshot
A new approach to interdomain routing based on secure multi-party computation
inferredcites →https://doi.org/10.1184/r1/6603947openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1287/moor.27.4.819.297openalex-snapshot
The Complexity of Decentralized Control of Markov Decision Processes
inferredcites →https://doi.org/10.1609/aaai.v24i1.7605openalex-snapshot
Transferable Utility Planning Games
inferredcites →https://doi.org/10.1609/aaai.v26i1.8253openalex-snapshot
Influence-Based Abstraction for Multiagent Systems
inferredcites →https://doi.org/10.1609/aaai.v27i1.8640openalex-snapshot
Cost-Optimal Planning by Self-Interested Agents
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13350openalex-snapshot
Scalable, Parallel Best-First Search for Optimal Sequential Planning
inferredcites →https://doi.org/10.1609/icaps.v20i1.13415openalex-snapshot
Cost-Optimal Factored Planning: Promises and Pitfalls
inferredcites →https://doi.org/10.1609/icaps.v20i1.13419openalex-snapshot
Influence-Based Policy Abstraction for Weakly-Coupled Dec-POMDPs
inferredcites →https://doi.org/10.1609/icaps.v21i1.13475openalex-snapshot
Directed Search for Generalized Plans Using Classical Planners
inferredcites →https://doi.org/10.1609/icaps.v22i1.13526openalex-snapshot
About Partial Order Reduction in Planning and Computer Aided Verification
inferredcites →https://doi.org/10.1609/icaps.v23i1.13540openalex-snapshot
Compiling Conformant Probabilistic Planning Problems into Classical Planning
inferredcites →https://doi.org/10.1609/icaps.v23i1.13565openalex-snapshot
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core
inferredcites →https://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferredcites →https://doi.org/10.1613/jair.2500openalex-snapshot
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
inferredcites →https://doi.org/10.1613/jair.477openalex-snapshot
Computational Aspects of Reordering Plans
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-465openalex-snapshot
Compiling Uncertainty Away in Non-Deterministic Conformant Planning
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-965openalex-snapshot
Completeness-Preserving Pruning for Optimal Planning
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-624openalex-snapshot
Tunneling and Decomposition-Based State Reduction for Optimal Planning
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-762openalex-snapshot
An approach to multi-agent planning with incomplete information
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-891openalex-snapshot
A Stubborn Set Algorithm for Optimal Planning
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-597openalex-snapshot
Privacy Preserving Landmark Detection
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-973openalex-snapshot
A Privacy-preserving Model for the Multi-agent Propositional Planning Problem
inferredcites →https://doi.org/10.3233/mgs-2009-0134openalex-snapshot
Efficient and distributable methods for solving the multiagent plan coordination problem
inferredcites →https://doi.org/10.48550/arxiv.1106.5427openalex-snapshot
Theory and Algorithms for Partial Order Based Reduction in Planning
inferredcites →https://doi.org/10.48550/arxiv.1207.1359openalex-snapshot
MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1501.07256openalex-snapshot
An approach to multi-agent planning with incomplete information
inferredcites →https://doi.org/10.5555/1838206.1838379openalex-snapshot
A general, fully distributed multi-agent planning algorithm
inferredcites →https://doi.org/10.5555/2343776.2343836openalex-snapshot
Heuristic search of multiagent influence space
inferredcites →https://doi.org/10.5555/2615731.2617391openalex-snapshot
A privacy-preserving algorithm for distributed constraint optimization
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-331openalex-snapshot
Computing perfect heuristics in polynomial time : on bisimulation and merge-and-shrink abstractions in optimal planning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/047134608x.w8336openalex-snapshot
Planning and Coordination in Multiagent Environments
inferred← citeshttps://doi.org/10.1002/cpe.4966openalex-snapshot
Scalable and optimal planning based on Pregel
inferred← citeshttps://doi.org/10.1007/978-3-030-03840-3_32openalex-snapshot
Iterative Width Search for Multi Agent Privacy-Preserving Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-37494-5_4openalex-snapshot
A General Approach to Distributed and Privacy-Preserving Heuristic Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-25524-8_40openalex-snapshot
Social Continual Planning in Open Multiagent Systems: A First Study
inferred← citeshttps://doi.org/10.1007/978-3-319-33509-4_2openalex-snapshot
From Public Plans to Global Solutions in Multiagent Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-50127-7_54openalex-snapshot
Multi-agent Planning with Collaborative Actions
inferred← citeshttps://doi.org/10.1007/978-3-319-69131-2_33openalex-snapshot
A Theory to Devise Dependable Cooperative Encounters
inferred← citeshttps://doi.org/10.1007/978-3-319-93581-2_8openalex-snapshot
$${\upvarepsilon }$$-Strong Privacy Preserving Multi-agent Planning
inferred← citeshttps://doi.org/10.1007/s10115-018-1202-1openalex-snapshot
Efficient approaches for multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-016-9333-9openalex-snapshot
Collaborative privacy preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-017-9367-7openalex-snapshot
Hybrid mission planning with coalition formation
inferred← citeshttps://doi.org/10.1007/s10458-018-9394-zopenalex-snapshot
Action dependencies in privacy-preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-022-09554-wopenalex-snapshot
Privacy preserving planning in multi-agent stochastic environments
inferred← citeshttps://doi.org/10.1007/s10458-022-09568-4openalex-snapshot
Privacy leakage of search-based multi-agent planning algorithms
inferred← citeshttps://doi.org/10.1007/s10458-022-09581-7openalex-snapshot
Reducing disclosed dependencies in privacy preserving planning
inferred← citeshttps://doi.org/10.1007/s10489-019-01429-0openalex-snapshot
Plan merging by reuse for multi-agent planning
inferred← citeshttps://doi.org/10.1016/j.actaastro.2020.10.041openalex-snapshot
Decentralized privacy-preserving onboard mission planning for multi-probe system
inferred← citeshttps://doi.org/10.1016/j.artint.2017.08.007openalex-snapshot
The MADLA planner: Multi-agent planning by combination of distributed and local heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.004openalex-snapshot
Star-topology decoupled state space search
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.002openalex-snapshot
Backdoors to Planning
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103200openalex-snapshot
Representing and planning with interacting actions and privacy
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103883openalex-snapshot
Width-based search for multi agent privacy-preserving planning
inferred← citeshttps://doi.org/10.1049/joe.2016.0076openalex-snapshot
Multi‐level decision making in hierarchical multi‐agent robotic search teams
inferred← citeshttps://doi.org/10.1080/00295639.2023.2239635openalex-snapshot
Preference-Based Multi-Robot Planning for Nuclear Power Plant Online Monitoring and Diagnostics
inferred← citeshttps://doi.org/10.1080/0952813x.2018.1456786openalex-snapshot
A privacy-preserving model for multi-agent propositional planning
inferred← citeshttps://doi.org/10.1080/0952813x.2021.1970239openalex-snapshot
Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions
inferred← citeshttps://doi.org/10.1109/aaac66612.2025.11427525openalex-snapshot
Multi-spacecraft Hybrid Heuristic Cooperative Task Planning for Asteroid Exploration
inferred← citeshttps://doi.org/10.1109/icit.2015.11openalex-snapshot
Validation and Verification of Joint-Actions in Multi-agent Planning
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197045openalex-snapshot
MAMS-A: Multi-Agent Multi-Scale A*
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561135openalex-snapshot
A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981389openalex-snapshot
Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation
inferred← citeshttps://doi.org/10.1109/tase.2023.3305392openalex-snapshot
Optimal Path Planning for a Convoy-Support Vehicle Pair Through a Repairable Network
inferred← citeshttps://doi.org/10.1109/tdsc.2020.3017497openalex-snapshot
Differentially Private Multi-Agent Planning for Logistic-like Problems
inferred← citeshttps://doi.org/10.1145/2970030.2970042openalex-snapshot
Secure Multi-Agent Planning
inferred← citeshttps://doi.org/10.1145/3133326openalex-snapshot
Quantifying Privacy Leakage in Multi-Agent Planning
inferred← citeshttps://doi.org/10.1177/0278364918774135openalex-snapshot
Simultaneous task allocation and planning for temporal logic goals in heterogeneous multi-robot systems
inferred← citeshttps://doi.org/10.1177/02783649211052066openalex-snapshot
GRSTAPS: Graphically Recursive Simultaneous Task Allocation, Planning, and Scheduling
inferred← citeshttps://doi.org/10.1515/9783111386690-004openalex-snapshot
513 Planen
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017594openalex-snapshot
Solving Multiagent Planning Problems with Concurrent Conditional Effects
inferred← citeshttps://doi.org/10.1609/aiide.v19i1.27505openalex-snapshot
MultiStyle: Characterizing Multiplayer Cooperative Gameplay by Incorporating Distinct Player Playstyles in a Multi-Agent Planner
inferred← citeshttps://doi.org/10.1609/aimag.v37i3.2658openalex-snapshot
The International Competition of Distributed and Multiagent Planners (CoDMAP)
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13701openalex-snapshot
Global Heuristics for Distributed Cooperative Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13705openalex-snapshot
Beating LM-Cut with h^max (Sometimes): Fork-Decoupled State Space Search
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13741openalex-snapshot
Online Macro Generation for Privacy Preserving Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13753openalex-snapshot
Stronger Privacy Preserving Projections for Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13757openalex-snapshot
Potential Heuristics for Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13821openalex-snapshot
Increased Privacy with Reduced Communication in Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13828openalex-snapshot
The Limits of Strong Privacy Preserving Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13889openalex-snapshot
Representing and Planning with Interacting Actions and Privacy
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3472openalex-snapshot
Best-First Width Search for Multi Agent Privacy-Preserving Planning
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3513openalex-snapshot
Privacy Leakage of Search-Based Multi-Agent Planning Algorithms
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6669openalex-snapshot
Privacy Preserving Planning in Stochastic Environments
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18505openalex-snapshot
Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18506openalex-snapshot
Trial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18402openalex-snapshot
Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18467openalex-snapshot
Stubborn Sets Pruning for Privacy Preserving Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11576openalex-snapshot
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search
inferred← citeshttps://doi.org/10.24963/ijcai.2018/816openalex-snapshot
Advances and Challenges in Privacy Preserving Planning
inferred← citeshttps://doi.org/10.3233/978-1-61499-672-9-1714openalex-snapshot
Secure Multi-Agent Planning Algorithms
inferred← citeshttps://doi.org/10.3233/aic-150671openalex-snapshot
Portfolio-based planning: State of the art, common practice and open challenges
inferred← citeshttps://doi.org/10.3390/app11136022openalex-snapshot
Can Social Agents Efficiently Perform in Automated Negotiation?
inferred← citeshttps://doi.org/10.3390/electronics9010005openalex-snapshot
Opponent-Aware Planning with Admissible Privacy Preserving for UGV Security Patrol under Contested Environment
inferred← citeshttps://doi.org/10.4204/eptcs.243.6openalex-snapshot
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination
inferred← citeshttps://doi.org/10.48550/arxiv.1810.13354openalex-snapshot
Privacy Preserving Multi-Agent Planning with Provable Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07185openalex-snapshot
Partial Disclosure of Private Dependencies in Privacy Preserving Planning
inferred← citeshttps://doi.org/10.5555/3091125.3091338openalex-snapshot
A Modular Framework for Decentralised Multi-Agent Planning
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.