Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel L. Kovacs

dblp:79/1932 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › multi-agent planning
distributed planning
0.212016
Competition of Distributed and Multiagent Planners (CoDMAP) · AAAI 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
multi-agent planning
0.212016
Competition of Distributed and Multiagent Planners (CoDMAP) · AAAI 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning › planning evaluation
planning competition
0.112016
Competition of Distributed and Multiagent Planners (CoDMAP) · AAAI 2016
YearPublicationVenuePosition
2016 Competition of Distributed and Multiagent Planners (CoDMAP)
abstract
As a part of the workshop on Distributed and Multiagent Planning (DMAP) at the International Conference on Automated Planning and Scheduling (ICAPS) 2015, we have organized a competition in distributed and multiagent planning. The main aims of the competition were to consolidate the planners in terms of input format; to promote development of multiagent planners both inside and outside of the multiagent research community; and to provide a proof-of-concept of a potential future multiagent planning track of the International Planning Competition (IPC). In this paper we summarize course and highlights of the competition.
Michal Stolba, Antonín Komenda, Daniel L. Kovacs
AAAI3
2012 Mixed Observability Markov Decision Processes for Overall Network Performance Optimization in Wireless Sensor Networks
abstract
Optimizing overall performance of Wireless Sensor Networks (WSNs) is important due to the limited resources available to nodes. Several aspects of this optimization problem have been studied (e.g. improving Medium Access Control (MAC) protocols, routing, energy management) mostly separately, although there is a strong inter-connection between them. In this paper an Artificial Intelligence (AI) based framework is presented to address this problem. Mixed-Observability Markov Decision Processes (MOMDPs) are used to effectively model multiple aspects of WSNs in stochastic environments including MAC in data link layer, routing in network layer, data aggregation, power management, etc. MOMDPs distinguish between full and partial observability, hence they are more efficient than other similar AI methods. The proposed framework provides global optimization of user-defined performance metrics, e.g. minimization of time delay, energy consumption and data inaccuracy. Near-optimal joint network policies are obtained via offline approximation of optimal MOMDP solutions and they are distributed among the individual nodes. Resulting node-policies place effectively no additional computational overhead on nodes in runtime. Experiments evaluate the framework by demonstrating near-optimal solutions for a small-scale WSN in detail in case of given tradeoff criteria. The proposed approach produces better joint network behavior in 5 out of 6 cases compared to other two standard methods in simulation by increasing overall network performance by more than 20% in average.
Daniel L. Kovacs, Wuyungerile Li, Naoki Fukuta, Takashi Watanabe 0001
AINA1