An Algorithm for Solving a Water-Pressure-Control Planning Problem with a Nondifferentiable Objective Function

Author(s):  
Yoshikazu Nishikawa ◽  
Akihiko Udo
Author(s):  
Shivakanth Gutta ◽  
Woosoon Yim ◽  
Mohamed B. Trabia

This paper presents an approach for trajectory planning and control of an underwater vehicle within obstacles. The vehicle is driven by a single IPMC actuator that goes through oscillatory locomotion. The presented work is divided into kinematic path planning and trajectory control sections. In the kinematic path planning phase, the vehicle is approximated by a rectangle that encloses the largest deformation of the oscillating IPMC actuator. Obstacles are approximated by polygonal shapes that approximate their actual dimensions. To simplify the problem of collision detection, vehicle is shrunk to a line while obstacles are expanded by a half width of the rectangle representing the vehicle. Path planning problem is formulated as a nonlinear programming problem that minimizes the error between current and goal configurations of the vehicle. The objective function combines the distance to target and the orientation of the vehicle. A penalty term is added to the objective function to ensure that the vehicle is not colliding with obstacles. The obtained path is discretized with respect to time, and controlled simultaneously for the yaw angle and speed of the vehicle. These two controllers are designed based on the simulation data from the dynamic model of the IPMC propelled vehicle. This proposed approach can be used in real time implementation of vehicle trajectory control in the presence of obstacles.


Water ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 1403
Author(s):  
Thomas John Voltz ◽  
Thomas Grischek

Wherever the flow of water in a gravity pipeline is regulated by a pressure control valve, hydraulic energy in the form of water pressure can instead be converted into useful mechanical and electrical energy via a turbine. Two classes of potential turbine sites exist—those with (class 1, “buffered”) and those without (class 2, “non-buffered”) a storage tank that decouples inflow from outflow, allowing the inflow regime to be modified to better suit turbine operation. A new method and Excel tool (freely downloadable, at no cost) were developed for determining the optimal hydraulic parameters of a turbine at class 1 sites that maximize annual energy generation. The method assumes a single microturbine with a narrow operating range and determines the optimal design flow rate based on the characteristic site curve and a historical time series of outflow data from the tank, simulating tank operation with a numerical model as it creates a new inflow regime. While no direct alternative methods could be found in the scientific literature or on the internet, three hypothetically applicable methods were gleaned from the German guidelines (published by the German Technical and Scientific Association for Gas and Water (DVGW)) and used as a basis of comparison. The tool and alternative methods were tested for nine sites in Germany.


2013 ◽  
Vol 753-755 ◽  
pp. 2628-2631
Author(s):  
Jin Hua Wang ◽  
Hong Yan Zhang ◽  
Jing Xia Niu

This paper show a parameter self-adaptive fuzzy PID controller which was designed by using fuzzy logical rules, and the rules aiming at characteristics of constant pressure water-supply system such as nonlinear, multi-parameters and long time delay. The controller can online auto tuning PID parameters to select the appropriate control parameters, depending on the working conditions for effective control of the water supply system water pressure regulator. The simulation results show that the control system response quick, over regulation measurement and transitional time is greatly reduced, oscillation time shorten, and the system has strong robustness and good stability.


2014 ◽  
Vol 687-691 ◽  
pp. 1443-1447
Author(s):  
Shou Fu Sun ◽  
Jun Huang ◽  
Wan Feng Ji ◽  
Yun Lin ◽  
Qian Yu Zhang

Route planning model problem is a key point in flight route planning problem research. Whether objective function model design is reasonable or not has very important influence on the efficiency and accuracy of route planning. Continuous threat probability function model is established, route planning objective function model is constructed, and genetic algorithm is applied to route planning, and finally the effectiveness of the model is verified by simulation calculation.


Author(s):  
Igor Kiselev

Previously proposed variational techniques for approximate MMAP inference in complex graphical models of high-order factors relax a dual variational objective function to obtain its tractable approximation, and further perform MMAP inference in the resulting simplified graphical model, where the sub-graph with decision variables is assumed to be a disconnected forest. In contrast, we developed novel variational MMAP inference algorithms and proximal convergent solvers, where we can improve the approximation accuracy while better preserving the original MMAP query by designing such a dual variational objective function that an upper bound approximation is applied only to the entropy of decision variables. We evaluate the proposed algorithms on both simulated synthetic datasets and diagnostic Bayesian networks taken from the UAI inference challenge, and our solvers outperform other variational algorithms in a majority of reported cases. Additionally, we demonstrate the important real-life application of the proposed variational approaches to solve complex tasks of policy optimization by MMAP inference, and performance of the implemented approximation algorithms is compared. Here, we demonstrate that the original task of optimizing POMDP controllers can be approached by its reformulation as the equivalent problem of marginal-MAP inference in a novel single-DBN generative model, which guarantees that the control policies computed by probabilistic inference over this model are optimal in the traditional sense. Our motivation for approaching the planning problem through probabilistic inference in graphical models is explained by the fact that by transforming a Markovian planning problem into the task of probabilistic inference (a marginal MAP problem) and applying belief propagation techniques in generative models, we can achieve a computational complexity reduction from PSPACE-complete or NEXP-complete to NPPP-complete in comparison to solving the POMDP and Dec-POMDP models respectively search vs. dynamic programming).


2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Shaotian Lu ◽  
Jingdong Zhao ◽  
Li Jiang ◽  
Hong Liu

The problem of minimum time-jerk trajectory planning for a robot is discussed in this paper. The optimal objective function is composed of two segments along the trajectory, which are the proportional to the total execution time and the proportional to the integral of the squared jerk (which denotes the derivative of the acceleration). The augmented Lagrange constrained particle swarm optimization (ALCPSO) algorithm, which combines the constrained particle swarm optimization (CPSO) with the augmented Lagrange multiplier (ALM) method, is proposed to optimize the objective function. In this algorithm, falling into a local best value can be avoided because a new particle swarm is generated per initial procedure, and the best value gained from the former generation is saved and delivered to the next generation during the iterative search procedure to enable the best value to be found more easily and more quickly. Finally, the proposed algorithm is tested on a planar 3-degree-of-freedom (DOF) robot; the simulation results show that the algorithm is effective, offering a solution to the time-jerk optimal trajectory planning problem of a robot under nonlinear constraints.


Sign in / Sign up

Export Citation Format

Share Document