Monetary policy rule is an approach to avoid time inconsistency problem as regarded by new classical economist to choose a time plan for policy making in order to maximize households’ well-being. The foundation of time inconsistency problem is not coincidence of expectations as an ex-ante variable, which is expected variable, with actual variable as an ex-post variable. Expectations in Finn K...

Probabilistic roadmap (PRM) planners [5, 16] solve apparently difficult motion planning problems where the robot's configuration space C has dimensionality six or more, and the geometry of the robot and the obstacles is described by hundreds of thousands of triangles. While an algebraic planner would be overwhelmed by the high cost of computing an exact representation of the free space F , defi...

We propose two new methods for performing local path search directly in the image space of a camera sensor. The first technique utilizes a high-resolution local image space subsystem to determine the farthest point along a global Cartesian path that can be reached along an unobstructed heading, thereby short-cutting as much of the global path as possible. To the best of our knowledge, this is t...

This paper presents a model of an airport apron that has been developed in order to determine a dynamical model for aircraft travel time in this area. This model is intended for future systems that will support automated routing and taxiing of aircraft in airport taxiways. The apron model proposed keeps into account the main issues related to the aircraft ground movements, such as aircraft conf...

Carole Rakodi is a Professor of International Urban Development in the International Development Department, School of Government and Society, University of Birmingham, England. She is a geographer and town planner, who has worked as a professional and researcher in developing countries for many years, mainly in Africa. Her main interests are in urban governance and politics, urban land, liveli...

In this paper, we propose a mixed approach for motion planning that decomposes the problem into two levels. At the global level, we build a graph whose nodes represent relatively large cells of the Configuration Space of the robotic system. Adjacent cells are connected by edges weighted by the probability for the local planner to succeed in computing a trajectory from a point in one cell to a g...