Výsledky vyhledávání

The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions

Autor: Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck

Publikováno v: Journal of Artificial Intelligence Research. 75:1477-1548

The LM-cut heuristic, both alone and as part of the operator counting framework, represents one of the most successful heuristics for classical planning. In this paper, we generalize LM-cut and its use in operator counting to optimal numeric planning

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::64dd5c58b8817a8b0d43da323cf2c606
https://doi.org/10.1613/jair.1.14034

Zobrazit plný text záznamu

Biased Exploration for Satisficing Heuristic Search

Autor: Ryo Kuroiwa, J. Christopher Beck

Publikováno v: Proceedings of the International Conference on Automated Planning and Scheduling. 32:213-221

Satisficing heuristic search such as greedy best-first search (GBFS) suffers from local minima, regions where heuristic values are inaccurate and a good node has a worse heuristic value than other nodes. Search algorithms that incorporate exploration

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::581d55958651a14a068d50644244282e
https://doi.org/10.1609/icaps.v32i1.19804

Zobrazit plný text záznamu

LM-Cut Heuristics for Optimal Linear Numeric Planning

Autor: Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck

Publikováno v: Proceedings of the International Conference on Automated Planning and Scheduling. 32:203-212

While numeric variables play an important, sometimes central, role in many planning problems arising from real world scenarios, most of the currently available heuristic search planners either do not support such variables or impose heavy restriction

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::89bab1d04d368af99b4b9b459a7e68a4
https://doi.org/10.1609/icaps.v32i1.19803

Zobrazit plný text záznamu

Supplement for Symmetry Detection and Breaking in Cost-Optimal Numeric Planning

Autor: Alexander Shleyfman, Ryo Kuroiwa, J. Christopher Beck

This document contains a detailed proof that the symmetry group of the colored numeric problem description graphis isomorphic to the group of numeric structural symmetries of the same task.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0edfe2f8e00e0df9b199c2b719ab46b5

Zobrazit plný text záznamu

On the Pathological Search Behavior of Distributed Greedy Best-First Search

Autor: Ryo Kuroiwa, Fukunaga, A.

Publikováno v: Scopus-Elsevier

Although A* search can be efficiently parallelized using methods such as Hash-Distributed A* (HDA*), distributed parallelization of Greedy Best First Search (GBFS), a suboptimal search which often finds solutions much faster than A*, has received lit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a08017da6600e9f9a03820b961b3da32
https://doi.org/10.1609/icaps.v29i1.3485

Zobrazit plný text záznamu

LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions

Autor: Ryo Kuroiwa, Shleyfman, A., Piacentini, C., Castro, M. P., Beck, J. C.

Publikováno v: Scopus-Elsevier

We consider optimal numeric planning with numeric conditions consisting of linear expressions of numeric state variables and actions that increase or decrease numeric state variables by constant quantities. We build on previous research to introduce

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdb52a10bf6f67010e507c164b4582f0
https://doi.org/10.1609/icaps.v31i1.15964

Zobrazit plný text záznamu

Accent Sandhi Estimation of Tokyo Dialect of Japanese Using Conditional Random Fields

Autor: Nobuaki Minematsu, Masayuki Suzuki, Ryo Kuroiwa, Shinya Shimizu, Keisuke Innami, Shumpei Kobayashi, Keikichi Hirose

Publikováno v: IEICE Transactions on Information and Systems. :655-661

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8d183fb8ac41779e98c24cb1cd4a9f4b
https://doi.org/10.1587/transinf.2016awi0004

Zobrazit plný text záznamu

Lossless/near-lossless color image coding by inverse demosaicing

Autor: Masahiro Okuda, Ryo Kuroiwa, Seisuke Kyochi, Ryo Matsuoka, Keiichiro Shirai

Publikováno v: ICASSP

In this paper, we introduce a novel framework for lossless/near-lossless (LS/NLS) color image coding assisted by an inverse demosaicing. Conventional frameworks are typically based on prediction (and quantization for NLS coding) followed by entropy c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5e25ca779aecb93dbfc91a33b6e35d09
https://doi.org/10.1109/icassp.2014.6853951

Zobrazit plný text záznamu

Analyzing and avoiding pathological behavior in parallel best-first search

Autor: Ryo Kuroiwa, Fukunaga, A.

Publikováno v: Scopus-Elsevier

Recent work has experimentally shown that parallelization of Greedy Best-First Search (GBFS), a satisficing best-first search method, can behave very differently from sequential GBFS. In this paper, we propose a theoretical framework to compare paral

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e89b6da8e661894178e967028ba9377
http://www.scopus.com/inward/record.url?eid=2-s2.0-85088530948&partnerID=MN8TOARS

Zobrazit plný text záznamu

Front-to-front heuristic search for satisficing classical planning

Autor: Alex Fukunaga, Ryo Kuroiwa

Publikováno v: Scopus-Elsevier
IJCAI

Although symbolic bidirectional search is successful in optimal classical planning, state-of-the-art satisficing planners do not use bidirectional search. Previous bidirectional search planners for satisficing planning behaved similarly to a trivial

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a109a8caa26c527310f63951c6137771
http://www.scopus.com/inward/record.url?eid=2-s2.0-85097333824&partnerID=MN8TOARS

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání