A survey on machine-learning techniques in cognitive radios
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 …
state the importance of artificial intelligence in achieving real cognitive communications …
Statistical relational artificial intelligence: Logic, probability, and computation
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 …
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
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 …
derived automatically from a model of the actions, sensors, and goals. The main challenges …
Reprel: Integrating relational planning and reinforcement learning for effective abstraction
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 …
environments. Inspired by the benefit of state abstraction in MAXQ and building upon hybrid …
Learning general planning policies from small examples without supervision
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 …
multiple instances of a planning domain all at once. It has been recently shown that these …
Symbolic network: generalized neural policies for relational MDPs
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 …
express all instances of a single probabilistic planning domain with possibly unbounded …
Learning features and abstract actions for computing generalized plans
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 …
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 …
web, network communication, computer vision, and robotics can elegantly be encoded and …
Symbolic dynamic programming for first-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for
sequential decision-making problems with partially-observed state and are known to have …
sequential decision-making problems with partially-observed state and are known to have …
General policies, subgoal structure, and planning width
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 …
by means of a simple polynomial exploration procedure, called IW, that runs in time …