Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2023
- Konosuke Fukushima, Tatsushi Nishi, Ziang Liu:
A Combined Deep Q-Network and Graph Search for Three Dimensional Route Planning Problems for Multiple Mobile Robots. CASE 2023: 1-6 - Xingrong Diao, Wenzheng Chi, Jiankun Wang:
Graph Neural Network Based Method for Path Planning Problem. CoRR abs/2309.14845 (2023) - 2022
- Einollah Pira:
Using deep learning techniques for solving AI planning problems specified through graph transformations. Soft Comput. 26(22): 12217-12234 (2022) - 2021
- Luping Zhang, Chunxia Yu, T. N. Wong:
A graph-based constraint programming approach for the integrated process planning and scheduling problem. Comput. Oper. Res. 131: 105282 (2021) - Tom Silver, Rohan Chitnis, Aidan Curtis, Joshua B. Tenenbaum, Tomás Lozano-Pérez, Leslie Pack Kaelbling:
Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks. AAAI 2021: 11962-11971 - 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) - 2020
- Einollah Pira:
A novel approach to solve AI planning problems in graph transformations. Eng. Appl. Artif. Intell. 92: 103684 (2020) - Tom Silver, Rohan Chitnis, Aidan Curtis, Joshua B. Tenenbaum, Tomás Lozano-Pérez, Leslie Pack Kaelbling:
Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks. CoRR abs/2009.05613 (2020) - 2019
- 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 - 2017
- Pavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey I. Nikolenko, Alexander V. Sirotkin:
Planning in compute-aggregate problems as optimization problems on graphs. ICNP 2017: 1-2 - 2016
- Eliseo Marzal, Laura Sebastia, Eva Onaindia:
Temporal landmark graphs for solving overconstrained planning problems. Knowl. Based Syst. 106: 14-25 (2016) - Ignasi Andrés, Leliane Nunes de Barros:
Using the Causal Graph to Enhance Translations to Solve Contingent Planning Problems. BRACIS 2016: 67-72 - Martin Wehrle, Silvan Sievers, Malte Helmert:
Graph-Based Factorization of Classical Planning Problems. IJCAI 2016: 3286-3292 - 2015
- Hesamoddin Monfared, Soheila Salmanpour:
Generalized intelligent Water Drops algorithm by fuzzy local search and intersection operators on partitioning graph for path planning problem. J. Intell. Fuzzy Syst. 29(2): 975-986 (2015) - 2014
- Andres Calderon Jaramillo, Jicheng Fu, Vincent Ng, Farokh B. Bastani, I-Ling Yen:
Fast Strong Planning for FOND Problems with Multi-Root Directed Acyclic Graphs. Int. J. Artif. Intell. Tools 23(6) (2014) - Shqiponja Ahmetaj, Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Planning Problems for Graph Structured Data in Description Logics. Description Logics 2014: 4-7 - 2013
- Jicheng Fu, Andres Calderon Jaramillo, Vincent Ng, Farokh B. Bastani, I-Ling Yen:
Fast Strong Planning for FOND Problems with Multi-root Directed Acyclic Graphs. ICTAI 2013: 87-94 - 2012
- Jun Hu:
Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring. (Algorithmes pour la détection d'un sous ensemble irréalisable irréductible dans un CSP - Applications aux problèmes d'affectation des fréquences et problème de k-coloration). Université de technologie de Belfort-Montbéliard, France, 2012 - Incheol Kim, Hyunsik Kim:
Planning Graph Heuristics for Solving Contingent Planning Problems. ICAART (1) 2012: 515-519 - 2011
- Omer Giménez, Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs. CoRR abs/1111.0056 (2011) - 2010
- Alfonso Gerevini, Alessandro Saetti, Ivan Serina:
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search. ICAPS 2010: 226-229 - 2009
- Raghvendra V. Cowlagi, Panagiotis Tsiotras:
Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning. ACC 2009: 414-419 - 2008
- Omer Giménez, Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs. J. Artif. Intell. Res. 31: 319-351 (2008) - 2007
- Omer Giménez, Anders Jonsson:
On the Hardness of Planning Problems with Simple Causal Graphs. ICAPS 2007: 152-159 - 2005
- Romeo Sanchez Nigenda, Subbarao Kambhampati:
Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems. ICAPS 2005: 192-201 - 2003
- Stephen B. Balakirsky:
A framework for planning with incrementally created graphs in attributed problem spaces. University of Bremen, Germany, DISKI 270, Infix Akademische Verlagsgesellschaft 2003, ISBN 978-3-89838-270-0, pp. I-XX, 1-259 - Toshiyuki Miyamoto, Syoji Yamashita, Sadatoshi Kumagai, Hideaki Ohta, Koichi Fukumoto, Yoichi Nagao:
A Graph Based Approach for an Extended Resource Planning and Line Balancing Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(11): 2739-2746 (2003) - 2002
- Mark A. Iwen, Amol Dattatraya Mali:
Interaction graphs for planning problem decomposition. AAMAS 2002: 984-985 - 1999
- Amnon Lotem, Dana S. Nau, James A. Hendler:
Using Planning Graphs for Solving HTN Planning Problems. AAAI/IAAI 1999: 534-540 - 1997
- Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos:
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Ann. Oper. Res. 69: 115-134 (1997)
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-23 01:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint