A survey on machine-learning techniques in cognitive radios

M Bkassiny, Y Li, SK Jayaweera - … Communications Surveys & …, 2012 - ieeexplore.ieee.org
In this survey paper, we characterize the learning problem in cognitive radios (CRs) and
state the importance of artificial intelligence in achieving real cognitive communications …

Statistical relational artificial intelligence: Logic, probability, and computation

LD Raedt, K Kersting, S Natarajan, D Poole - Synthesis lectures on …, 2016 - Springer
An intelligent agent interacting with the real world will encounter individual people, courses,
test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of …

[BOOK][B] A concise introduction to models and methods for automated planning

H Geffner, B Bonet - 2013 - books.google.com
Planning is the model-based approach to autonomous behavior where the agent behavior is
derived automatically from a model of the actions, sensors, and goals. The main challenges …

Reprel: Integrating relational planning and reinforcement learning for effective abstraction

H Kokel, A Manoharan, S Natarajan… - Proceedings of the …, 2021 - ojs.aaai.org
State abstraction is necessary for better task transfer in complex reinforcement learning
environments. Inspired by the benefit of state abstraction in MAXQ and building upon hybrid …

Learning general planning policies from small examples without supervision

G Frances, B Bonet, H Geffner - … of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
Generalized planning is concerned with the computation of general policies that solve
multiple instances of a planning domain all at once. It has been recently shown that these …

Symbolic network: generalized neural policies for relational MDPs

S Garg, A Bajpai - International Conference on Machine …, 2020 - proceedings.mlr.press
Abstract A Relational Markov Decision Process (RMDP) is a first-order representation to
express all instances of a single probabilistic planning domain with possibly unbounded …

Learning features and abstract actions for computing generalized plans

B Bonet, G Frances, H Geffner - Proceedings of the AAAI Conference on …, 2019 - aaai.org
Generalized planning is concerned with the computation of plans that solve not one but
multiple instances of a planning domain. Recently, it has been shown that generalized plans …

Lifted probabilistic inference

K Kersting - ECAI 2012, 2012 - ebooks.iospress.nl
Many AI problems arising in a wide variety of fields such as machine learning, semantic
web, network communication, computer vision, and robotics can elegantly be encoded and …

Symbolic dynamic programming for first-order POMDPs

S Sanner, K Kersting - Proceedings of the AAAI Conference on Artificial …, 2010 - ojs.aaai.org
Partially-observable Markov decision processes (POMDPs) provide a powerful model for
sequential decision-making problems with partially-observed state and are known to have …

General policies, subgoal structure, and planning width

B Bonet, H Geffner - Journal of Artificial Intelligence Research, 2024 - jair.org
It has been observed that many classical planning domains with atomic goals can be solved
by means of a simple polynomial exploration procedure, called IW, that runs in time …