Back to Results
First PageMeta Content
Applied mathematics / Logic programming / Logic in computer science / Convex optimization / Operations research / Situation calculus / Relaxation / Event calculus / Fluent / Theoretical computer science / Mathematical optimization / Mathematics


Optimisation and Relaxation for Multiagent Planning in the Situation Calculus Toby O. Davies Adrian R. Pearce
Add to Reading List

Document Date: 2015-02-19 22:22:59

Open Document

File Size: 315,84 KB

Share Result on Facebook

City

Istanbul / Prolog / /

Company

MIT Press / IOS Press / Multiagent Systems / Implementing Dynamical Systems / Intel / IEEE Comp / AAAI Press / /

Country

Turkey / /

/

Event

Reorganization / /

Facility

The University / The University of Melbourne National ICT Australia / Harald Søndergaard The University / /

IndustryTerm

bl solutions / search strategies / informed search techniques / relax-&-merge algorithm / polynomial-time algorithms / multi-agent applications / dual solution / feasible solution / uniform cost search / depth-first search / candidate solution / breadth-first search / search techniques / informed search algorithms / collaborative search / search algorithm / dynamical systems / train services / /

OperatingSystem

Ubuntu / /

Organization

University of Melbourne / International Foundation for Autonomous Agents Copyright / MIT / Australian Government / ICT Centre of Excellence Program / Australian Research Council / /

Person

Computational Combinatorial / Harald Søndergaard / /

Position

central planner / editor / IEEE/WIC/ACM Int / Golog interpreter / abductive event calculus planner / General / salesman / Prolog-based multi-agent Golog interpreter / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

RAM / Intelligent Agent Technology / artificial intelligence / search algorithm / polynomial-time algorithms / ESA / informed search algorithms / Yolum The relax-&-merge algorithm / /

URL

www.ifaamas.org / /

SocialTag