![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Éric Jacopin
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c21]Thomas Pontoizeau, Éric Jacopin:
Online low-power large-scale real-time decision-making all at once. AICAS 2023: 1-5 - [c20]Guillaume Prévost, Stéphane Cardon, Tristan Cazenave, Christophe Guettier, Éric Jacopin:
Topological Planning with Post-unique and Unary Actions. IJCAI 2023: 5429-5436 - 2022
- [c19]Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton:
Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks. AAAI 2022: 9877-9885 - [c18]Guillaume Prévost, Éric Jacopin, Tristan Cazenave, Christophe Guettier:
Planning for millions of NPCs in Real-Time. SSCI 2022: 330-336 - [i6]Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton:
Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks. CoRR abs/2203.15030 (2022) - [i5]Kevin Osanlou, Christophe Guettier, Tristan Cazenave, Eric Jacopin:
Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles. CoRR abs/2207.13181 (2022) - 2021
- [c17]Mael Ahmad Addoum
, Jannah Mekhaemar, Maxime Rouffet, Éric Jacopin:
Khaldun: GOAP for both Procedural Level generation and NPC Behaviors. CoG 2021: 1-2 - [c16]Mael Ahmad Addoum
, Maxime Rouffet, Éric Jacopin:
3D Brawler Game Using a Hybrid Planning Approach. CoG 2021: 1-2 - [c15]Aline Hufschmitt, Stéphane Cardon, Éric Jacopin:
Dynamic Manipulation of Player Performance with Music Tempo in Tetris. IUI 2021: 290-296 - [i4]Kevin Osanlou, Christophe Guettier, Andrei Bursuc, Tristan Cazenave, Eric Jacopin:
Constrained Shortest Path Search with Graph Convolutional Neural Networks. CoRR abs/2108.00978 (2021) - [i3]Kevin Osanlou, Andrei Bursuc, Christophe Guettier, Tristan Cazenave, Eric Jacopin:
Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search. CoRR abs/2108.01036 (2021) - [i2]Kevin Osanlou, Jeremy Frank, J. Benton, Andrei Bursuc, Christophe Guettier, Eric Jacopin, Tristan Cazenave:
Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance. CoRR abs/2108.01068 (2021) - [i1]Kevin Osanlou, Christophe Guettier, Andrei Bursuc, Tristan Cazenave, Eric Jacopin:
Learning-based Preference Prediction for Constrained Multi-Criteria Path-Planning. CoRR abs/2108.01080 (2021) - 2020
- [c14]Aline Hufschmitt, Stéphane Cardon, Éric Jacopin:
Manipulating Player Performance via Music Tempo in Tetris. CHI PLAY (Companion) 2020: 146-152 - [c13]Aline Hufschmitt, Stéphane Cardon, Éric Jacopin:
Can Musical Tempo Makes Tetris Game Harder? CoG 2020: 608-611 - [c12]Aline Hufschmitt, Stéphane Cardon, Éric Jacopin:
Sonotris: Testing the Influence of Musical Tempo on Tetris Players Performance. CoG 2020: 626-627 - [c11]Stéphane Cardon, Éric Jacopin:
Binary GPU-Planning for Thousands of NPCs. CoG 2020: 678-681 - [c10]Éric Jacopin:
Entropy to Control Planning in Video-Games. ISITA 2020: 41-45
2010 – 2019
- 2019
- [c9]Kevin Osanlou, Andrei Bursuc, Christophe Guettier, Tristan Cazenave, Eric Jacopin:
Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search. IROS 2019: 3519-3525 - [c8]Guillaume Prévost, Stéphane Cardon, Tristan Cazenave, Eric Jacopin:
Planification dans les jeux-vidéos : À quoi servent les coûts des actions ? RJCIA 2019: 66-68 - 2018
- [c7]Eric Jacopin:
Statistical Planning: Building Models of Entropy of Centralized Planning for Multi-Agent Systems. Allerton 2018: 100-109 - 2017
- [c6]Alexandre Menif, Christophe Guettier, Eric Jacopin, Tristan Cazenave:
Applying Anytime Heuristic Search to Cost-Optimal HTN Planning. CGW@IJCAI 2017: 151-171 - 2014
- [c5]Eric Jacopin:
Game AI Planning Analytics: The Case of Three First-Person Shooters. AIIDE 2014 - [c4]Alexandre Menif, Eric Jacopin, Tristan Cazenave:
SHPE: HTN Planning for Video Games. CGW@ECAI 2014: 119-132
2000 – 2009
- 2009
- [c3]Olivier Bartheye, Eric Jacopin:
A PDDL-Based Planning Architecture to Support Arcade Game Playing. AGS 2009: 170-189 - [c2]Olivier Bartheye, Eric Jacopin:
A Real-Time PDDL-based Planning Component for Video Games. AIIDE 2009 - [c1]Olivier Bartheye, Eric Jacopin:
A planning plug-in for Virtual Battle Space 2 a report from the trenches. SpringSim 2009
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint