Antonin Komenda

Dr. Antonin Komenda

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2007
Verified
Conference Paper
Closed access
DSDavid Sislak
David Sislak
PVPremysl Volf
Premysl Volf
AKAntonin Komenda
Antonin Komenda
JSJirf Samek
Jirf Samek
MPMichal Pechoucek
Michal Pechoucek
This contribution presents a distributed, multi-layer collision avoidance architecture supporting efficient utilization of air space shared by several autonomous aerial vehicles. Presented multi-layer architecture is based on deliberative deployment of several collision avoidance methods by the aircraft at the same time. Both cooperative and non-cooperative collision avoidance methods are presented in the paper. The robustness of the architecture is justified by means of experimental validation of multi-agent simulation

1 January 2014 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
AKAntonin Komenda
Antonin Komenda
PNPeter Novák
Peter Novák
MPMichal Pěchouček
Michal Pěchouček

1 September 2016 in AI Magazine
Verified
Journal Article
Closed access
PDF file
AKAntonin Komenda
Antonin Komenda
MŠMichal Štolba
Michal Štolba
DKDaniel L. Kovacs
Daniel L. Kovacs
This article reports on the first international Competition of Distributed and Multiagent Planners (CoDMAP). The competition focused on cooperative domain-independent planners compatible with a minimal multiagent extension of the classical planning model. The motivations for the competition were manifold: to standardize the problem description language with a common set of benchmarks, to promote development of multiagent planners both inside and outside of the multiagent research community, and to serve as a prototype for future multiagent planning competitions. The article provides an overview of cooperative multiagent planning, describes a novel variant of standardized input language for encoding mutliagent planning problems and summarizes the key points of organization, competing planners and results of the competition.

18 October 2010 in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Verified
Journal Article
Closed access
JVJiri Vokrinek
Jiri Vokrinek
AKAntonin Komenda
Antonin Komenda
MPMichal Pechoucek
Michal Pechoucek
Problem solving and planning in decentralized environments is a key technical challenge in numerous industrial applications, ranging from manufacturing, logistics, virtual enterprizes to multirobotics systems. We present an abstract architecture of a multiagent solver and respective algorithm providing decomposition, task allocation, and task delegation. Various features of the abstract architecture, such as computational complexity or admissibility of the underlying optimization heuristics, are analyzed in the paper. Four instances of the abstract architecture implementations are given to demonstrate the applicability of the abstract solver in a wide variety of real-problem domains.

1 November 2017 in Artificial Intelligence
Verified
Journal Article
Closed access
MŠMichal Štolba
Michal Štolba
AKAntonin Komenda
Antonin Komenda

15 May 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JMJan Mrkos
Jan Mrkos
AKAntonin Komenda
Antonin Komenda
DFDavid Fiedler
David Fiedler
JVJiří Vokřínek
Jiří Vokřínek
This paper introduces a novel model for online dynamic pricing of electric vehicle charging services that integrates reservation, parking, and charging into a comprehensive bundle priced as a whole. Our approach focuses on the individual high-demand, fast-charging location, employing a Poisson process as a model of charging reservation arrivals, and develops an online dynamic pricing strategy optimized through a Markov Decision Process (MDP). A key contribution is the novel analysis of discretization error introduced when incorporating the continuous-time Poisson process into the discrete MDP framework. The MDP model’s feasibility is demonstrated with a heuristic dynamic pricing method based on Monte-Carlo tree search, offering a viable path for real-world applications.