期刊文献+
共找到457篇文章
< 1 2 23 >
每页显示 20 50 100
Adaptive path planning for unmanned aerial vehicles based on bi-level programming and variable planning time interval 被引量:7
1
作者 Liu Wei Zheng Zheng Cai Kaiyuan 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2013年第3期646-660,共15页
This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory cap... This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles (SAMs) are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances. 展开更多
关键词 ADAPTIVE bi-level programming Motion planning Unmanned aerial vehicles Variable time interval
原文传递
Bi-level programming model for reconstruction of urban branch road network 被引量:6
2
作者 史峰 黄恩厚 +1 位作者 陈群 王英姿 《Journal of Central South University》 SCIE EI CAS 2009年第1期172-176,共5页
Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level progra... Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network. 展开更多
关键词 branch road RECONSTRUCTION bi-level programming model micro-circulation traffic
在线阅读 下载PDF
Bi-level Hybrid Stochastic/Robust Optimization for Low-carbon Virtual Power Plant Dispatch 被引量:1
3
作者 Xuan Wei Yinliang Xu +1 位作者 Hongbin Sun Haotian Zhao 《CSEE Journal of Power and Energy Systems》 2025年第5期2012-2023,共12页
Rapid development of power-to-gas technology provides a potential solution for virtual power plants(VPP)to achieve near-zero carbon emissions.In this paper,a bi-level hybrid stochastic/robust optimization model is pro... Rapid development of power-to-gas technology provides a potential solution for virtual power plants(VPP)to achieve near-zero carbon emissions.In this paper,a bi-level hybrid stochastic/robust optimization model is proposed for low-carbon VPP day-ahead dispatch considering uncertainties from renewable generation and market prices.First,Karush-Kuhn-Tucker optimality conditions are employed to convert the bi-level model to a single level one.Next,the single level problem is decomposed into a master problem in the base case and several subproblems in extreme cases,which can then be solved by using the column-and-constraint generation algorithm iteratively.Numerical results indicate the proposed approach can effectively satisfy system operation constraints including the carbon emission limit,enhance computational efficiency and algorithm robustness compared with the stochastic method,and improve VPP revenue compared with the robust method. 展开更多
关键词 bi-level optimization column-and-constraint generation hybrid stochastic/robust methods low-carbon virtual power plant
原文传递
Random Fuzzy Chance-constrained Programming Based on Adaptive Chaos Quantum Honey Bee Algorithm and Robustness Analysis 被引量:3
4
作者 Han Xue Xun Li Hong-Xu Ma 《International Journal of Automation and computing》 EI 2010年第1期115-122,共8页
This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to ... This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable.In CQHBA,each bee carries a group of quantum bits representing a solution.Chaos optimization searches space around the selected best-so-far food source.In the marriage process,random interferential discrete quantum crossover is done between selected drones and the queen.Gaussian quantum mutation is used to keep the diversity of whole population.New methods of computing quantum rotation angles are designed based on grads.A proof of con-vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented.Numerical examples are presented to demonstrate its superiority in robustness and stability,efficiency of computational complexity,success rate,and accuracy of solution quality.CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings,variable initializations,system tolerance and confidence level,perturbations,and noises. 展开更多
关键词 Honey bee algorithm random fuzzy programming quantum computation chaos optimization robustNESS
在线阅读 下载PDF
Two-stage robust optimization of power cost minimization problem in gunbarrel natural gas networks by approximate dynamic programming 被引量:1
5
作者 Yi-Ze Meng Ruo-Ran Chen Tian-Hu Deng 《Petroleum Science》 SCIE CAS CSCD 2022年第5期2497-2517,共21页
In short-term operation of natural gas network,the impact of demand uncertainty is not negligible.To address this issue we propose a two-stage robust model for power cost minimization problem in gunbarrel natural gas ... In short-term operation of natural gas network,the impact of demand uncertainty is not negligible.To address this issue we propose a two-stage robust model for power cost minimization problem in gunbarrel natural gas networks.The demands between pipelines and compressor stations are uncertain with a budget parameter,since it is unlikely that all the uncertain demands reach the maximal deviation simultaneously.During solving the two-stage robust model we encounter a bilevel problem which is challenging to solve.We formulate it as a multi-dimensional dynamic programming problem and propose approximate dynamic programming methods to accelerate the calculation.Numerical results based on real network in China show that we obtain a speed gain of 7 times faster in average without compromising optimality compared with original dynamic programming algorithm.Numerical results also verify the advantage of robust model compared with deterministic model when facing uncertainties.These findings offer short-term operation methods for gunbarrel natural gas network management to handle with uncertainties. 展开更多
关键词 Natural gas Gunbarrel gas pipeline networks robust optimization Approximate dynamic programming
原文传递
An Interval-parameter Fuzzy Robust Nonlinear Programming Model for Water Quality Management
6
作者 Min Liu Guoxin Nie +2 位作者 Ming Hu Renfei Liao Yangshuo Shen 《Journal of Water Resource and Protection》 2013年第1期12-16,共5页
Planning for water quality management is important for facilitating sustainable socio-economic development;however, the planning is also complicated by a variety of uncertainties and nonlinearities. In this study, an ... Planning for water quality management is important for facilitating sustainable socio-economic development;however, the planning is also complicated by a variety of uncertainties and nonlinearities. In this study, an interval-parameter fuzzy robust nonlinear programming (IFRNP) model was developed for water quality management to deal with such difficulties. The developed model incorporated interval nonlinear programming (INP) and fuzzy robust programming (FRP) methods within a general optimization framework. The developed IFRNP model not only could explicitly deal with uncertainties represented as discrete interval numbers and fuzzy membership functions, but also was able to deal with nonlinearities in the objective function. 展开更多
关键词 Water Quality Management INTERVAL programming FUZZY robust programming Nonlinear programming UNCERTAINTY
在线阅读 下载PDF
An Alternative Approach for Solving Bi-Level Programming Problems
7
作者 Rashmi Birla Vijay K. Agarwal +1 位作者 Idrees A. Khan Vishnu Narayan Mishra 《American Journal of Operations Research》 2017年第3期239-247,共9页
An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, ... An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper. 展开更多
关键词 LINEAR programming PROBLEM bi-level programming PROBLEM GRAPH Algorithm
在线阅读 下载PDF
Bi-Level Programming for the Optimal Nonlinear Distance-Based Transit Fare Structure Incorporating Principal-Agent Game
8
作者 Xin Sun Shuyan Chen Yongfeng Ma 《Journal of Harbin Institute of Technology(New Series)》 CAS 2022年第5期69-77,共9页
The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit a... The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit assignment and improper transit resources distribution.In order to distribute transit passenger flow evenly and efficiently,this paper introduces a new distance-based fare pattern with Euclidean distance.A bi-level programming model is developed for determining the optimal distance-based fare pattern,with the path-based stochastic transit assignment(STA)problem with elastic demand being proposed at the lower level.The upper-level intends to address a principal-agent game between transport authorities and transit enterprises pursing maximization of social welfare and financial interest,respectively.A genetic algorithm(GA)is implemented to solve the bi-level model,which is verified by a numerical example to illustrate that the proposed nonlinear distance-based fare pattern presents a better financial performance and distribution effect than other fare structures. 展开更多
关键词 bi-level programming model principal-agent game nonlinear distance-based fare path-based stochastic transit assignment
在线阅读 下载PDF
SEMI-INFINITE INTERVAL-VALUED OPTIMIZATION PROBLEMS WITH ROBUST CONSTRAINTS
9
作者 Anurag JAYSWAL Ajeet KUMAR 《Acta Mathematica Scientia》 2026年第1期383-406,共24页
In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered... In this paper,we consider a robust semi-infinite interval-valued optimization problem with inequality constraints having an uncertain parameter.The parametric representation of the aforesaid problem is also considered in order to derive the necessary and sufficient optimality conditions.Furthermore,we formulate a mixed-type dual problem and derive duality results which associate the robust weak efficient solution of the primal and its dual problems.Several examples are given to illustrate the results in the manuscript. 展开更多
关键词 semi-infinite programming interval-valued programming robust weak efficient solution optimality conditions DUALITY
在线阅读 下载PDF
Decentralized Dispatch with Distributionally Robust Joint Chance Constraints for Integrated Electrical and Heating System via Dynamic Boundary Response
10
作者 Chang Yang Zhengshuo Li Yixun Xue 《CSEE Journal of Power and Energy Systems》 2026年第1期508-520,共13页
With the widespread application of combined heat and power(CHP)units,the economic dispatch of integrated electric and district heating systems(IEHSs)has drawn increasing attention.Because the electric power system(EPS... With the widespread application of combined heat and power(CHP)units,the economic dispatch of integrated electric and district heating systems(IEHSs)has drawn increasing attention.Because the electric power system(EPS)and district heating system(DHS)are generally managed separately,the decentralized dispatch pattern is preferable for the IEHS dispatch problem.However,many common decentralized methods suffer from the drawbacks of slow and local convergence.Moreover,the uncertainties of renewable generation cannot be ignored in a decentralized pattern.Additionally,the most commonly used individual chance constraints in distributionally robust optimization cannot consider safety constraints simultaneously,so the safe operation of an IEHS cannot be guaranteed.Thus,distributionally robust joint chance constraints and robust constraints are jointly introduced into the IEHS dispatch problem in this paper to obtain a stronger safety guarantee,and a method combined with Bonferroni and conditional value at risk(CVaR)approximation is presented to transform the original model into a quadratic program.Additionally,a dynamic boundary response(DBR)-based distributed algorithm based on multiparametric programming is proposed for a fast solution.Case studies showcase the necessity of using mixed distributionally robust joint chance constraints and robust constraints,as well as the effectiveness of the DBR algorithm. 展开更多
关键词 Decentralized optimization distributionally robust optimization integrated electric and district heating systems joint chance constraint multiparametric programming
原文传递
Bilevel Programming Model for Joint Scheduling of Arrival and Departure Flights Based on Traffic Scenario 被引量:8
11
作者 JIANG Hao LIU Jixin ZHOU Wenshen 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2021年第4期671-684,共14页
In order to meet the needs of collaborative decision making,considering the different demands of air traffic control units,airlines,airports and passengers in various traffic scenarios,the joint scheduling problem of ... In order to meet the needs of collaborative decision making,considering the different demands of air traffic control units,airlines,airports and passengers in various traffic scenarios,the joint scheduling problem of arrival and departure flights is studied systematically.According to the matching degree of capacity and flow,it is determined that the traffic state of arrival/departure operation in a certain period is peak or off-peak.The demands of all parties in each traffic state are analyzed,and the mathematical models of arrival/departure flight scheduling in each traffic state are established.Aiming at the four kinds of joint operation traffic scenarios of arrival and departure,the corresponding bi-level programming models for joint scheduling of arrival and departure flights are established,respectively,and the elitism genetic algorithm is designed to solve the models.The results show that:Compared with the first-come-firstserved method,in the scenarios of arrival peak&departure off-peak and arrival peak&departure peak,the departure flight equilibrium satisfaction is improved,and the runway occupation time of departure flight flow is reduced by 38.8%.In the scenarios of arrival off-peak&departure off-peak and departure peak&arrival off-peak,the arrival flight equilibrium delay time is significantly reduced,the departure flight equilibrium satisfaction is improved by 77.6%,and the runway occupation time of departure flight flow is reduced by 46.6%.Compared with other four kinds of strategies,the optimal scheduling method can better balance fairness and efficiency,so the scheduling results are more reasonable. 展开更多
关键词 air traffic management arrival and departure flight scheduling bi-level programming departure flight equilibrium satisfaction arrival flight equilibrium delay time
在线阅读 下载PDF
An ADP-based robust control scheme for nonaffine nonlinear systems with uncertainties and input constraints
12
作者 Shijie Luo Kun Zhang Wenchao Xue 《Chinese Physics B》 2025年第6期251-260,共10页
The paper develops a robust control approach for nonaffine nonlinear continuous systems with input constraints and unknown uncertainties. Firstly, this paper constructs an affine augmented system(AAS) within a pre-com... The paper develops a robust control approach for nonaffine nonlinear continuous systems with input constraints and unknown uncertainties. Firstly, this paper constructs an affine augmented system(AAS) within a pre-compensation technique for converting the original nonaffine dynamics into affine dynamics. Secondly, the paper derives a stability criterion linking the original nonaffine system and the auxiliary system, demonstrating that the obtained optimal policies from the auxiliary system can achieve the robust controller of the nonaffine system. Thirdly, an online adaptive dynamic programming(ADP) algorithm is designed for approximating the optimal solution of the Hamilton–Jacobi–Bellman(HJB) equation.Moreover, the gradient descent approach and projection approach are employed for updating the actor-critic neural network(NN) weights, with the algorithm's convergence being proven. Then, the uniformly ultimately bounded stability of state is guaranteed. Finally, in simulation, some examples are offered for validating the effectiveness of this presented approach. 展开更多
关键词 adaptive dynamic programming robust control nonaffine nonlinear system neural network
原文传递
Event-Triggered Robust Parallel Optimal Consensus Control for Multiagent Systems
13
作者 Qinglai Wei Shanshan Jiao +1 位作者 Qi Dong Fei-Yue Wang 《IEEE/CAA Journal of Automatica Sinica》 2025年第1期40-53,共14页
This paper highlights the utilization of parallel control and adaptive dynamic programming(ADP) for event-triggered robust parallel optimal consensus control(ETRPOC) of uncertain nonlinear continuous-time multiagent s... This paper highlights the utilization of parallel control and adaptive dynamic programming(ADP) for event-triggered robust parallel optimal consensus control(ETRPOC) of uncertain nonlinear continuous-time multiagent systems(MASs).First, the parallel control system, which consists of a virtual control variable and a specific auxiliary variable obtained from the coupled Hamiltonian, allows general systems to be transformed into affine systems. Of interest is the fact that the parallel control technique's introduction provides an unprecedented perspective on eliminating the negative effects of disturbance. Then, an eventtriggered mechanism is adopted to save communication resources while ensuring the system's stability. The coupled HamiltonJacobi(HJ) equation's solution is approximated using a critic neural network(NN), whose weights are updated in response to events. Furthermore, theoretical analysis reveals that the weight estimation error is uniformly ultimately bounded(UUB). Finally,numerical simulations demonstrate the effectiveness of the developed ETRPOC method. 展开更多
关键词 Adaptive dynamic programming(ADP) critic neural network(NN) event-triggered control optimal consensus control robust control
在线阅读 下载PDF
连续时间系统混合迭代鲁棒自适应评判控制
14
作者 王鼎 刘奥 乔俊飞 《自动化学报》 北大核心 2026年第1期137-147,共11页
针对存在扰动的连续时间非线性系统,设计一种结合混合迭代机制和自适应评判框架的鲁棒控制方法.通过优化传统值迭代方法,实现加速学习并放宽了预设条件的目标.引入可调参数确保控制策略在迭代过程中的可容许性,从而放松了加速因子的设... 针对存在扰动的连续时间非线性系统,设计一种结合混合迭代机制和自适应评判框架的鲁棒控制方法.通过优化传统值迭代方法,实现加速学习并放宽了预设条件的目标.引入可调参数确保控制策略在迭代过程中的可容许性,从而放松了加速因子的设置条件.结合广义策略迭代的思想,构建新型混合迭代机制,从而获得更优的收敛性能.最后,利用两个仿真实例验证了所提方法的性能.针对线性系统的仿真结果表明,本文方法具有较高的收敛精度.在导弹自动驾驶仪系统仿真中,相对于值迭代方法,本文方法不依赖初始可容许控制策略,同时能使收敛速度提高约49%. 展开更多
关键词 自适应动态规划 连续时间系统 评判网络 混合迭代 HJI方程 鲁棒控制
在线阅读 下载PDF
Approach to evaluating exception handling of programs
15
作者 姜淑娟 徐宝文 《Journal of Southeast University(English Edition)》 EI CAS 2007年第4期524-528,共5页
To solve the problems that the exception handling code is hard to test and maintain and that it affects the robustness and reliability of software, a method for evaluating the exception handling of programs is present... To solve the problems that the exception handling code is hard to test and maintain and that it affects the robustness and reliability of software, a method for evaluating the exception handling of programs is presented. The exception propagation graph (EPG) that describes the large programs with exception handling constructs is proposed by simplifying the control flow graph and it is applied to a case to verify its validity. According to the EPG, the exception handling code that never executes is identified; the points that are the most critical to controlling exception propagation are found; and the irrational exception handling code is corrected. The constructing algorithm for the EPG is given; thus, this provides a basis for automatically constructing the EPG and automatically correcting the irrational exception handling code. 展开更多
关键词 software robustness exception handling exception propagation evaluating program control flow graph
在线阅读 下载PDF
虚拟电厂鲁棒调度特性可信量化与协调调度方法
16
作者 冯德品 刘正奇 +4 位作者 徐兵 陈涛 崔波 王成福 董晓明 《发电技术》 2026年第1期225-236,共12页
【目的】基于虚拟电厂(virtual power plant,VPP)技术聚合区域电网内部分布式资源,能以低边际成本有效提高系统灵活性。然而,信息安全等因素导致的数据壁垒,以及分布式协调计算效率和调控资源的不确定性等问题给虚拟电厂辅助服务决策带... 【目的】基于虚拟电厂(virtual power plant,VPP)技术聚合区域电网内部分布式资源,能以低边际成本有效提高系统灵活性。然而,信息安全等因素导致的数据壁垒,以及分布式协调计算效率和调控资源的不确定性等问题给虚拟电厂辅助服务决策带来困难。据此,分析VPP整体对外特性,包括关口功率、备用能力及运行成本,提出了一种VPP鲁棒调度特性可信量化方法,并构建多VPP博弈的协同调度模型。【方法】首先,考虑分布式电源和需求响应不确定因素影响,解析网络约束下的源荷备用潜力,从而建立VPP数学模型;其次,结合鲁棒优化和多参数规划理论,实现VPP关口功率调节空间、弹性备用能力和最优成本鲁棒可行域可信量化,建立VPP内部资源调控策略与对外交易结果的仿射关系,完成VPP等值聚合;进一步,构建了多VPP与主网有效互动的合作博弈模型;最后,通过3个测试算例验证了本文模型和方法的有效性。【结果】所量化的封装模型参与调度具有更高的计算效率,且保护了VPP内部信息隐私性。通过设计并行程序,封装模型量化过程计算效率得到了进一步提升。【结论】所提方法能有效支撑多重VPP主体协同大电网进行能量和辅助服务的交易,加强主网安全防御体系建设。 展开更多
关键词 虚拟电厂 可信量化 鲁棒优化 多参数规划 等值聚合 合作博弈
在线阅读 下载PDF
一种面向不确定障碍边界的分布鲁棒连续避障MPC方法
17
作者 何兆 尹旖旎 《中国惯性技术学报》 北大核心 2026年第2期193-201,共9页
为解决路径规划方法在不确定环境中扰动分布不可知的挑战,提出一种基于Wasserstein分布鲁棒优化的连续避障模型预测控制算法(DRSMPC)。在障碍物边界概率分布未知的情形下,构建了基于Wasserstein模糊集的避障约束,并引入“同侧逻辑一致... 为解决路径规划方法在不确定环境中扰动分布不可知的挑战,提出一种基于Wasserstein分布鲁棒优化的连续避障模型预测控制算法(DRSMPC)。在障碍物边界概率分布未知的情形下,构建了基于Wasserstein模糊集的避障约束,并引入“同侧逻辑一致性”约束,确保了在连续时间维度上的安全性。实验结果显示,所提方法在狭窄环境中相较传统机会约束方法,在多种扰动分布下的碰撞率由大于50%降低至约5%。在复杂环境的参数敏感性分析中,Wasserstein球半径有效调节了路径保守性与代价间的平衡,当半径增大时碰撞率可降低至约1%。综合多场景结果,所提方法在所有测试环境下均实现最低碰撞率,显著优于OBCA、SAA-MPC等传统基线,体现出在不确定扰动条件下的强鲁棒性与适用性。 展开更多
关键词 模型预测控制 分布鲁棒优化 路径规划 混合整数规划 不确定避障
在线阅读 下载PDF
Performance Analysis of Intelligent Robust Facility Layout Design 被引量:2
18
作者 G MOSLEMIPOUR T S LEE Y T LOONG 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2017年第2期407-418,共12页
Design of a robust production facility layout with minimum handling cost (MHC) presents an appropriate approach to tackle facility layout problems in a dynamic volatile environment, in which product demands randomly... Design of a robust production facility layout with minimum handling cost (MHC) presents an appropriate approach to tackle facility layout problems in a dynamic volatile environment, in which product demands randomly change in each planning period. The objective of the design is to find the robust facility layout with minimum total material handling cost over the entire multiperiod planning horizon. This paper proposes a new mathematical model for designing robust machine layout in the stochastic dynamic environment of manufacturing systems using quadratic assignment problem (QAP) formulation. In this investigation, product demands are assumed to be normally distributed random variables with known expected value, variance, and covariance that randomly change from period to period. The proposed model was verified and validated using randomly generated numerical data and benchmark examples. The effect of dependent product demands and varying interest rate on the total cost function of the proposed model has also been investigated. Sensitivity analysis on the proposed model has been performed. Dynamic programming and simulated annealing optimization algorithms were used in solving the modeled example problems. 展开更多
关键词 robust layout Dynamic stochastic environment Manufacturing system Dynamic programming
在线阅读 下载PDF
Non-probabilistic Robust Optimal Design Method 被引量:1
19
作者 SUN Wei XU Huanwei 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2009年第2期184-189,共6页
For the purpose of dealing with uncertainty factors in engineering optimization problems,this paper presents a new non-probabilistic robust optimal design method based on maximum variation estimation.The method analyz... For the purpose of dealing with uncertainty factors in engineering optimization problems,this paper presents a new non-probabilistic robust optimal design method based on maximum variation estimation.The method analyzes the effect of uncertain factors to objective and constraints functions,and then the maximal variations to a solution are calculated.In order to guarantee robust feasibility the maximal variations of constraints are added to original constraints as penalty term;the maximal variation of objective function is taken as a robust index to a solution;linear physical programming is used to adjust the values of quality characteristic and quality variation,and then a bi-level mathematical robust optimal model is constructed.The method does not require presumed probability distribution of uncertain factors or continuous and differentiable of objective and constraints functions.To demonstrate the proposed method,the design of the two-bar structure acted by concentrated load is presented.In the example the robustness of the normal stress,feasibility of the total volume and the buckling stress are studied.The robust optimal design results show that in the condition of maintaining feasibility robustness,the proposed approach can obtain a robust solution which the designer is satisfied with the value of objective function and its variation. 展开更多
关键词 variation analysis linear physical programming bi-level optimization robust design
在线阅读 下载PDF
Compliant landing of a trotting quadruped robot based on hybrid motion/force robust control 被引量:2
20
作者 郎琳 王剑 +1 位作者 韦庆 马宏绪 《Journal of Central South University》 SCIE EI CAS CSCD 2016年第8期1970-1980,共11页
A compliant landing strategy for a trotting quadruped robot on unknown rough terrains based on contact force control is presented. Firstly, in order to lower the disturbance caused by the landing impact force, a landi... A compliant landing strategy for a trotting quadruped robot on unknown rough terrains based on contact force control is presented. Firstly, in order to lower the disturbance caused by the landing impact force, a landing phase is added between the swing phase and the stance phase, where the desired contact force is set as a small positive constant. Secondly, the joint torque optimization of the stance legs is formulated as a quadratic programming(QP) problem subject to equality and inequality/bound constraints. And a primal-dual dynamical system solver based on linear variational inequalities(LVI) is applied to solve this QP problem. Furthermore, based on the optimization results, a hybrid motion/force robust controller is designed to realize the tracking of the contact force, while the constraints of the stance feet landing angles are fulfilled simultaneously. Finally, the experiments are performed to validate the proposed methods. 展开更多
关键词 trotting quadruped robots compliant landing joint torque optimization quadratic programming(QP) hybrid motion/force robust control
在线阅读 下载PDF
上一页 1 2 23 下一页 到第
使用帮助 返回顶部