Name
Affiliation
Papers
RONEN I. BRAFMAN
Computer Science Dept., Ben-Gurion Univ., Israel
136
Collaborators
Citations 
PageRank 
469
3260
220.63
Referers 
Referees 
References 
3811
1584
1779
Search Limit
1001000
Title
Citations
PageRank
Year
Unavoidable deadends in deterministic partially observable contingent planning.00.342023
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles.00.342021
Reinforcement Learning With Non-Markovian Rewards00.342020
Learning and Solving Regular Decision Processes00.342020
Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains.00.342019
Regular Decision Processes - A Model for Non-Markovian Domains.00.342019
Regular Decision Processes: Modelling Dynamic Systems without Using Hidden Variables00.342019
Privacy Preserving Multi-Agent Planning with Provable Guarantees.00.342018
A Planning Approach to Monitoring Computer Programs' Behavior.00.342018
LTLf/LDLf Non-Markovian Rewards.00.342018
Representing and Planning with Interacting Actions and Privacy.10.352018
A Planning Approach to Monitoring Behavior of Computer Programs.00.342017
Service Composition in Stochastic Settings.00.342017
Specifying Non-Markovian Rewards in MDPs Using LDL on Finite Traces (Preliminary Version).00.342017
Interactions between knowledge and time in a first-order logic for multi-agent systems: completeness results70.502014
A heuristic search approach to planning with continuous resources in stochastic domains200.782014
Cooperative Monitoring to Diagnose Multiagent Plans.70.422014
Optimal ordering of independent tests with precedence constraints60.592014
Distributed Heuristic Forward Search for Multi-agent Planning.251.072014
Partially Observable Online Contingent Planning Using Landmark Heuristics.80.502014
On the complexity of planning for agent teams and its implications for single agent planning230.902013
Distributed Heuristic Forward Search for Multi-Agent Systems.60.482013
Structured reachability analysis for Markov decision processes202.242013
Introducing variable importance tradeoffs into CP-nets533.222013
Compiling Conformant Probabilistic Planning Problems into Classical Planning.50.412013
UCP-Networks: A Directed Graphical Representation of Conditional Utilities896.652013
Qualitative Planning under Partial Observability in Multi-Agent Domains.60.462013
Multi-agent A* for parallel and distributed systems221.342012
Multi-agent A* for parallel and distributed systems00.342012
A Multi-Path Compilation Approach to Contingent Planning.150.682012
Replanning in Domains with Partial Information and Sensing Actions.230.872012
Tunneling and Decomposition-Based State Reduction for Optimal Planning.90.542012
Compact value-function representations for qualitative preferences130.762012
Structure and Complexity in Planning with Unary Operators462.492011
On graphical modeling of preference and importance883.612011
Learning to Coordinate Efficiently: a model-based approach130.932011
Partial-order planning with concurrent interacting actions492.212011
Acquiring word-meaning mappings for natural language interfaces141.442011
Extended Lifted Inference with Joint Formulas100.762011
The Minimal Seed Set Problem.00.342011
Replanning in domains with partial information and sensing actions120.652011
The Next Best Solution.10.362011
Designing with interactive example galleries482.422010
A general, fully distributed multi-agent planning algorithm361.382010
Planning Games60.672009
Directional Decomposition of Multiattribute Utility Functions30.452009
Preference Handling - An Introductory Tutorial411.442009
Prioritizing Point-Based POMDP Solvers150.802008
Relational preference rules for control50.522008
Graphically structured value-function compilation110.542008
  • 1
  • 2