home

Cooking, made it easy

COLOMBIAN SPICY SAUCE

Dificulty: easy
Approx. quantity 1.5 cups

Artificial Intelligent

heuristic search for cyclic graph, LAO*

LAO* is a heuristic search algorithm that can find optimal solutions for MDPs without evaluating the entire state space, and takes the form of a cyclic graph,that is, a solution with loops.

There are several reasons why the execution of a plan may fail, whether internal (the execution of an action fails) or external (changes in the world, damaged or add objects, etc). If we go to temporals plans, the factors may be much larger and more delicate, such action runs faster or slower than expected.

Monitoring the Execution of Partial-Order Plans via Regression

Article reviews

Este articulo, consiguen las condiciones en las que un POP continua siendo viable (ejecutable) por medio de la regression de los goal a través de la estructura de un POP.

State Space Search

State space search involves finding a path from the initial state of a search problem to a goal state.

Astronomy

Visiting the Roque de los Muchachos

I was visiting the Roque de Los Muchachos Observatory from 6-7 Aug. It was awesome !

Figure 1. Observatory the Roque de los Muchachos.

TreeSet

It is based on TreeMap, the main different is that TreeSet is an implementation of Set interface and TreeMap on Map interface.

This kind of collection sorts your entries just when they are inserted. No need to call sort().

Building a Domain-Independent Architecture for Planning, Learning and Execution (PELEA)

César Guzmán², Vidal Alcázar¹, David Prior³, Eva Onaindía², Daniel Borrajo¹, Juan Fdez-Olivares³.
Universidad Carlos III de Madrid¹, Universidad Politècnica de València², Universidad de Granada³

This paper appears in: 21th International Conference on Automated Planning and Scheduling, ICAPS - Systems Demo. Freiburg, Germany.

Issue Date: Jun.11-16, 2011

PELEA: Planning, Learning and Execution Architecture

Vidal Alcázar¹, César Guzmán2, David Prior³, Daniel Borrajo¹, Luis Castillo³, Eva Onaindia²
Universidad Carlos III de Madrid¹, Universidad Politécnica de Valéncia², Universidad de Granada³

This paper appears in: 28th Workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG. Brescia, Italy.

Issue Date: Dec. 1-3, 2010 ISSN: 1368-5708

Anytime Plan Adaptation for Continuous Planning

Antonio Garrido, César Guzmán, Eva Onaindia
Universidad Politècnica de València,

This paper appears in: 28th Workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG. Brescia, Italy.

Issue Date: Dec. 1-3, 2010

e-Tourism: A Tourist Recommendation and Planning Application - Journal

Sebastia, L.; Garcia, I.; Onaindia, E.; Guzman, C.
Universidad Politècnica de València,

This paper appears in: Journal on Artificial Intelligent, IEEE. Ohio, USA.

Issue Date: Oct. 3-5, 2009

A Group Recommender System for Tourist Activities

Inma Garcia, Laura Sebastia, Eva Onaindia and Cesar Guzman.
Universidad Politècnica de València,

This paper appears in: 10th International Conference, EC-Web. Linz, Austria.

Issue Date: Sep. 1-4, 2009. Proceedings ISBN: 978-3-642-03963-8 Core: B

e-Tourism: A Tourist Recommendation and Planning Application

Page 3 of 4

Follow me:

cguzman

After graduating at the University of San Buenaventura Cartagena de Indias (Colombia), I traveled to Germany at the University of Heidelberg to learn German. I was joined as a Master candidate at University Politécnica of Valencia (Spain) at 2007. My master thesis in Computer Science was finished in 2009 with Dr. Eva Onaindia as my advisor. Next, I continued with my Ph.D. dissertation, which I finished at 5th april 2019. My main research interests are planning and scheduling, reactive planning in multi-agent systems, coordinate the plan execution of several agents, execution, monitoring, decision support for repairing and re-planning focused on any aspect of real life. I love the science and the space !