We describe generalized D = 11 Poincaré and conformal supersymmetries. The corresponding generalization of twistor and supertwistor framework is outlined with OSp(1|64) superspinors describing BPS preons. The k 32 BPS states as composed out of n = 32 − k preons are introduced, and basic ideas concerning BPS preon dynamics is presented. The lecture is based on results obtained by J.A. de Azcarra...

This paper proposes an optimal transmission expansion planning (TEP) which is based on determining share of each line in merchandizing surplus (MS) of system, determining by Independent System Operator (ISO). The more share of a line in MS of system denotes the priority of a line for expansion. The procedure of determining MS of each line in a power system is based on determining the MS share o...

We consider the problem of on-line continual planning, in which additional goals may arrive while plans for previous goals are still executing and plan quality depends on how quickly goals are achieved. This is a challenging problem even in domains with deterministic actions. One common and straightforward approach is reactive planning, in which plans are synthesized when a new goal arrives. In...

MESS is a substrate for building simulation environments suitable for testing plans and on-line or realtime planners. The article describes the design of MEss, how simulations are built and how on-line planners integrate with the substrate. MEss supports activities, defined as processes over some time interval, and interactions between activities and other simulation events. MEss interfaces wit...

We consider the problem of on-line continual planning, in which additional goals may arrive while plans for previous goals are still executing and plan quality may depend on how quickly goals are achieved. Even in domains with deterministic actions, this is a challenging problem. One common and straightforward approach is reactionary planning, in which fresh plans are synthesized when a new goa...

The line planning problem in public transport deals with the construction of a system of lines that is both attractive for the passengers and of low costs for the operator. In general, the computed line system should be connected, i.e., for each two stations there have to be a path that is covered by the lines. This subproblem is a generalization of the well-known Steiner tree problem; we call ...

This thesis introduces the Steiner connectivity problem. It is a generalization of the well known Steiner tree problem. Given a graph G = (V,E) and a subset T ⊆ V of the nodes, the Steiner tree problem consists in finding a cost minimal set of edges connecting all nodes in T . The Steiner connectivity problem chooses, instead of edges, from a given set of paths a subset to connect all nodes in ...

My research proposes an approach to integrating planning and execution in time-sensitive environments, a setting I call continual on-line planning. New goals arrive stochastically during execution, the agent issues actions for execution one at a time, and the environment is otherwise deterministic. My dissertation will address this setting in three stages: optimizing total goal achievement time...