Complete Call for Papers 

This website is dedicated to the editorial and author-support activities of the journal 'Artificial Intelligence', usually referred to as the AIJ. It does not document the publisher's activities (but see the link to Elsevier's website at the top right of this page, "AIJ@Elsevier").

FREE ACCESS TO ARTIFICIAL INTELLIGENCE JOURNAL IS RE-ESTABLISHED!!
FOR FURTHER INFORMATION PLEASE SEE http://aij.ijcai.org/free-access-to-the-ai-journal

The editorial process is organized by the Artificial Intelligence Journal Division (AIJD) of IJCAI.

All submissions should be made via the Elsevier's Editorial System. Submission via email is not possible. 

- AIJ has approved a new policy regarding under what circumstances a submission to AIJ may include work previously published in a conference paper by the same author

THE SUMMER CALL FOR FUNDING IS NOW COMPLETED.
CLICK HERE TO VIEW THE RESULTS.

Printed version out now of the
Special Issue on Autonomous Agents Modelling Other Agents,
Edited by Stefano V. Albrecht, Peter Stone, Michael P. Wellman

THE WINNERS OF THE 2020 CLASSIC AND PROMINENT PAPER AWARDS

2020 AIJ Classic Paper Award

This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a framework for processing temporal constraints. In this framework, called temporal constraint satisfaction problem (TCSP), variables represent time points and temporal information is represented by a set of unary and binary constraints, each specifying a set of permitted intervals. The unique feature of ...

 

2020 AIJ Prominent Paper Award

Conflict-based search for optimal multi-agent pathfinding

G Sharon, R Stern, A Felner, N Sturtevant - Artificial intelligence, 2015

URL: https://www.sciencedirect.com/science/article/pii/S0004370214001386

In the multi-agent pathfinding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding collisions. Most previous work on solving this problem optimally has treated the individual agents as a single ‘joint agent’ and then applied single-agent search variants of the A* algorithm. ...