Sentence examples for minimum time problem from inspiring English sources

end{aligned} (50) We will start from the last spike, Neuron 1, for this example and solve the minimum time problem P1 for all the initial condition for Neuron 2, namely (v_{2} in[0, V_{G}]), (v_{1} = 0), and use the solution of P1 as the terminal cost (varphi textbf {v} tau _{1}))) for the previous spike, Neuron 1 again, in our case.

Two different types of optimisation problems, namely, maximum conversion and minimum time problems are formulated and solved and optimal operation policies in terms of reactor temperature or coolant flow rate are obtained.

Control engineers have long known that such optimal control strategies where the control signal abruptly switches between on/off positions arise in a variety of minimum-time problems.

This paper explores a near minimum time control problem with constrained control input magnitudes.

In this section, we formulate an attitude-trajectory minimum time control problem, denoted by ((mathcal {P}_{S})).

For batchwise radical chain polymerization, the minimum end time problem is studied for the "optimal" process and "best" isothermal process by.

For batchwise radical chain solution polymerization, the minimum end time problem is studied by considering the initiator concentration (or feed rate) and temperature as two control variables.

The types of problems related to optimal control are terminal control problem, minimum-time control problem, minimum energy control problem, regulator control problem, and tracking control problem.

Yu et al. [23] claim the NP-hardness of the minimum time aggregation scheduling problem in duty-cycled WSNs, later on referred to as dc-MTAS problem, and have presented an aggregation scheduling algorithm.

The minimum time to climb problem provides an example of two time-scale behavior and motivates the discussion.

Two simulation examples, the Breakwell problem and a minimum time robot obstacle avoidance problem with different numbers of obstacles, are used to demonstrate the capabilities of the algorithms.