نتایج جستجو برای: dynamic expansion planning
تعداد نتایج: 727470 فیلتر نتایج به سال:
This paper presents a simple and efficient approach to the computation of avoidance maneuvers among moving obstacles. The method is discussed for the case of a single maneuvering object avoiding several obstacles moving on known linear trajectories. The original dynamic problem is transformed into several static problems using the relative velocity between the maneuvering object and each obstac...
We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement functio...
Contracts often take the form of options: oil fields can be abandoned, planning permission may go unused, and acquired firms can be liquidated. We consider a seller who auctions a dynamic option among N agents. After the auction, the economy evolves and the winning bidder chooses both if and when to execute the option. The revenue-maximising auction consists of an up-front bid and a contingent ...
For solving complex robot tasks it is necessary to incorpo rate path planning methods that are able to operate within di erent high dimensional con guration spaces containing an unknown number of obstacles Based on Advanced A algorithm AA using expansion matrices instead of a simple expansion logic we propose a further im provement of AA enabling the capability to learn directly from sample pla...
This paper investigates the use of ant-colony optimization, simulated annealing, and genetic algorithms for distribution network expansion planning (DNEP) including distributed generation (DG). It may be introduced as a combinatorial optimization method that determines the location and capacity of feeders and substations while minimizing the network loss and installation cost. In this paper, DG...
Artificial intelligence in games is typically used for creating player’s opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cumbersome task that needs experienced designers. Our research aims to assist designers in this task. Behaviours typically use recurring patterns, so that experience and reuse are crucial aspects for behavior design. The use o...
In this paper, a new multi-objective model for the expansion planning of the renewable distributed generation (DG) in smart distribution networks based on the passive defense considerations is proposed. The proposed planning model aims to minimize the outage duration of the distribution network loads considering priority of critical, sensitive and important loads. It also aims to minimize netwo...
Electricity is so basic to the world economy that certain electricity indices are used to express a country's economic standing (consumption or production of electricity per capita) and the standard of living enjoyed by a people (per capita electricity consumption in the domestic sector). Moreover, electricity supply has special characteristics which make the service unique as compared to other...
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
Within the electric power literature the transmission expansion planning problem (TNEP) refers to the problem of how to upgrade an electric power network to meet future demands. As this problem is a complex, non-linear, and non-convex optimization problem, researchers have traditionally focused on approximate models of power flows. Existing approaches are often tightly coupled to the approximat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید