Search | Engineering

Subscribe Submit

Home Journals Focus Achievement Fronts About Us 中文版

Resource Type

Journal Article 274

Year

2024 1

2023 31

2022 39

2021 35

2020 23

2019 17

2018 19

2017 19

2016 11

2015 5

2014 1

2013 1

2012 6

2011 5

2010 4

2009 3

2008 6

2007 7

2006 12

2005 6

open ︾

Keywords

Multi-agent system 8

Multi-agent systems 6

Reinforcement learning 4

5G 2

Antenna-in-package (AiP) 2

Artificial intelligence 2

Beamforming 2

Consensus 2

Data-driven 2

Deep learning 2

Distributed optimization 2

Fog computing 2

Multi-model 2

Target tracking 2

mine hydraulic winder 2

sustainable development 2

2-dimensions optical orthogonal square codes (2D-OOSC) 1

2D–3D registration 1

3D cell containers 1

open ︾

Search scope:

排序： Display mode:

Optimal two-impulse space interception with multiple constraints Research Articles

Li Xie, Yi-qun Zhang, Jun-yan Xu,lixie@ncepu.edu.cn,yiqunzhang@hotmail.com,junyan_Xu@sina.cn

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 7, Pages 963-1118 doi: 10.1631/FITEE.1800763

Abstract: We consider optimal two-impulse with . The are imposed on the terminal position of a space interceptor, impulse and impact instants, and the component-wise magnitudes of velocity impulses. These optimization problems are formulated as and solved by the calculus of variations. Slackness variable methods are used to convert all inequality constraints into equality constraints so that the Lagrange multiplier method can be used. A new is presented. As a result, an indirect optimization method is developed. Subsequently, our method is used to solve the two-impulse of free-flight ballistic missiles. A number of conclusions for have been drawn based on highly accurate numerical solutions. Specifically, by numerical examples, we show that when time and velocity impulse constraints are imposed, optimal two-impulse solutions may occur; if two-impulse instants are free, then a two-impulse space interception problem with velocity impulse constraints may degenerate to a one-impulse case.

Keywords：空间拦截问题；变分法；多约束；两速度脉冲；多点边值问题；局部最优解；动态松弛变量法

HTML PDF Collect

Finite-time formation control for first-order multi-agent systems with region constraints Research Articles

Zhengquan Yang, Xiaofang Pan, Qing Zhang, Zengqiang Chen,zquanyang@163.com,1219006322@qq.com,qz120168@hotmail.com,chenzq@nankai.edu.cn

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 1, Pages 1-140 doi: 10.1631/FITEE.2000177

Abstract: In this study, the control of s with region constraints is studied. Multiple agents have first-order dynamics and a common target area. A novel control algorithm is proposed using local information and interaction. If the communication graph is undirected and connected and the desired framework is rigid, it is proved that the controller can be used to solve the formation problem with a target area. That is, all agents can enter the desired region in finite time while reaching and maintaining the desired formation shapes. Finally, a numerical example is given to illustrate the results.

Keywords： Finite-time formation Multi-agent system Asymptotic convergence Set constraint Lyapunov theorem

HTML PDF Collect

Dual-constraint burst image denoising method Research Articles

Dan ZHANG, Lei ZHAO, Duanqing XU, Dongming LU,cszhd@zju.edu.cn,cszhl@zju.edu.cn,xdq@zju.edu.cn,ldm@zju.edu.cn

Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 2, Pages 220-233 doi: 10.1631/FITEE.2000353

Abstract: has proven to be an effective mechanism for computer vision tasks, especially for and burst . In this paper, we focus on solving the burst problem and aim to generate a single clean image from a burst of noisy images. We propose to combine the power of block matching and 3D filtering (BM3D) and a convolutional neural network (CNN) for burst . In particular, we design a CNN with a divide-and-conquer strategy. First, we employ BM3D to preprocess the noisy burst images. Then, the preprocessed images and noisy images are fed separately into two parallel CNN branches. The two branches produce somewhat different results. Finally, we use a light CNN block to combine the two outputs. In addition, we improve the performance by optimizing the two branches using two different constraints: a signal constraint and a noise constraint. One maps a clean signal, and the other maps the noise distribution. In addition, we adopt block matching in the network to avoid frame misalignment. Experimental results on synthetic and real noisy images show that our algorithm is competitive with other algorithms.

Keywords： Image denoising Burst image denoising Deep learning

HTML PDF Collect

A Study About IC and IR in Principal-gent RelationshipUnder the Engineer Supervision Institution

Qin Xuan

Strategic Study of CAE 2007, Volume 9, Issue 4, Pages 45-49

Abstract:

According to principal-agent theory, the Incentive compatibility constraint(IC)and the participation constraint (IR) in principal-gent relationship between employer and engineer are analyzed. The conclusions are drawn:The incentive compatibility constraint (IC) is more important than participation constraint (IR), If the mechanism doesn't satisfy the needs of IC, then it will be inefficient. If the employer wants to improve the engineer supervision institution, it must adopt incentive mechanisms which can make the engineer work hard, in the mean time the incentive mechanisms play efficient roles in solving the moral hazard. This paper will provide some implications for engineer supervision development in China.

Keywords： engineer supervision employer engineer principal-gent incentive compatibility constraint(IC) participation constraint(IR)

HTML PDF Collect

Distributed optimization based on improved push-sum framework for optimization problem with multiple local constraints and its application in smart grid

徐谦,俞楚天,袁翔,韦梦立,刘洪喆

Frontiers of Information Technology & Electronic Engineering 2023, Volume 24, Issue 9, Pages 1253-1260 doi: 10.1631/FITEE.2200596

Abstract: In this paper, the optimization problem subject to ,N, nonidentical closed convex set constraints is studied. The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solve the considered problem. To this end, with the push-sum framework improved, the distributed optimization algorithm is newly designed, and its strict convergence analysis is given under the assumption that the involved graph is strongly connected. Finally, simulation results support the good performance of the proposed algorithm.

Keywords： Distributed optimization Nonidentical constraints Improved push-sum framework

HTML Collect

ApproximateGaussian conjugacy: parametric recursive filtering under nonlinearity,multimodality, uncertainty, and constraint, and beyond Review

Tian-cheng LI, Jin-ya SU, Wei LIU, Juan M. CORCHADO

Frontiers of Information Technology & Electronic Engineering 2017, Volume 18, Issue 12, Pages 1913-1939 doi: 10.1631/FITEE.1700379

Abstract: Since the landmark work of R. E. Kalman in the 1960s, considerable efforts have been devoted to time series state space models for a large variety of dynamic estimation problems. In particular, parametric filters that seek analytical estimates based on a closed-form Markov–Bayes recursion, e.g., recursion from a Gaussian or Gaussian mixture (GM) prior to a Gaussian/GM posterior (termed ‘Gaussian conjugacy’ in this paper), form the backbone for a general time series filter design. Due to challenges arising from nonlinearity, multimodality (including target maneuver), intractable uncertainties (such as unknown inputs and/or non-Gaussian noises) and constraints (including circular quantities), etc., new theories, algorithms, and technologies have been developed continuously to maintain such a conjugacy, or to approximate it as close as possible. They had contributed in large part to the prospective developments of time series parametric filters in the last six decades. In this paper, we review the state of the art in distinctive categories and highlight some insights that may otherwise be easily overlooked. In particular, specific attention is paid to nonlinear systems with an informative observation, multimodal systems including Gaussian mixture posterior and maneuvers, and intractable unknown inputs and constraints, to fill some gaps in existing reviews and surveys. In addition, we provide some new thoughts on alternatives to the first-order Markov transition model and on filter evaluation with regard to computing complexity.

Keywords： Kalman filter Gaussian filter Time series estimation Bayesian filtering Nonlinear filtering Constrained filtering Gaussian mixture Maneuver Unknown inputs

HTML PDF Collect

A multi-sensor-system cooperative scheduling method for ground area detection and target tracking Research Article

Yunpu ZHANG, Qiang FU, Ganlin SHAN

Frontiers of Information Technology & Electronic Engineering 2023, Volume 24, Issue 2, Pages 245-258 doi: 10.1631/FITEE.2200121

Abstract: A multi-sensor-system cooperative scheduling method for multi-task collaboration is proposed in this paper. We studied the method for application in ground and . The aim of is to select the optimal sensors to complete the assigned combat tasks and obtain the best combat benefits. First, an model was built, and the method of calculating the detection risk was proposed to quantify the detection benefits in scheduling. Then, combining the information on and the , a ground model was established, in which the posterior Carmér-Rao lower bound was applied to evaluate future tracking accuracy. Finally, an objective function was developed which considers the requirements of detection, tracking, and energy consumption control. By solving the objective function, the optimal sensor-scheduling scheme can be obtained. Simulation results showed that the proposed sensor-scheduling method can select suitable sensors to complete the required combat tasks, and provide good performance in terms of , , and energy consumption control.

Keywords： Sensor scheduling Area detection Target tracking Road constraints Doppler blind zone

HTML PDF Collect

Pulse Transiently Chaotic Neural Network for Nonlinear Constrained Optimization

Li Ying,Cao Hongzhao,Hu Yunchang,Shang Xiuming

Strategic Study of CAE 2004, Volume 6, Issue 5, Pages 45-48

Abstract:

Pulse Transiently Chaotic Neural Network (PTCNN) can find almost all optima including the part optima and the global with its abundance dynamical characteristic, when is used in nonlinear non-constrained optimization. The optimization problem is first unconstrained by virtue of non-differentiable exact penalty function, and is further solved by PTCNN. It is showed by an example that this method is efficient.

Keywords： PTCNN penalty function nonlinear constrained optimization

HTML PDF Collect

Vibration-Driven Microrobot Positioning Methodologies for Nonholonomic Constraint Compensation Article

Kostas Vlachos, Dimitris Papadimitriou, Evangelos Papadopoulos

Engineering 2015, Volume 1, Issue 1, Pages 66-72 doi: 10.15302/J-ENG-2015016

Abstract:

This paper presents the formulation and practical implementation of positioning methodologies that compensate for the nonholonomic constraints of a mobile microrobot that is driven by two vibrating direct current (DC) micromotors. The open-loop and closed-loop approaches described here add the capability for net sidewise displacements of the microrobotic platform. A displacement is achieved by the execution of a number of repeating steps that depend on the desired displacement, the speed of the micromotors, and the elapsed time. Simulation and experimental results verified the performance of the proposed methodologies.

Keywords： microrobotics vibration micromotor actuation nonholonomic planning nonholonomic constraints compensation

HTML PDF Collect

Present Situation and Future Prospects of Child Restraint Systems for Vehicles

Fang Yuan,Wu Guangqiang

Strategic Study of CAE 2006, Volume 8, Issue 8, Pages 81-85

Abstract:

Child restraint system(CRS)is a new study field in the world. Especially in China, the CRS research is particularly meaningful with the rapid growth of the number of child passengers. The amendment and optimization on the regulations of CRS are brought out based on the distinction between CRS and occupant safety systems. The application of advanced design theory, the technology of computer simulation and the systematical analysis strategy will bring a new prospect for the development of CRS.

Keywords： child restraint system safety chair sled test injury criteria rating program

HTML PDF Collect

Low complexity robust adaptive beamforming for general-rank signal model with positive semidefinite constraint Article

Yu-tang ZHU,Yong-bo ZHAO,Jun LIU,Peng-lang SHUI

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 11, Pages 1245-1252 doi: 10.1631/FITEE.1601112

Abstract: We propose a low complexity robust beamforming method for the general-rank signal model, to combat against mismatches of the desired signal array response and the received signal covariance matrix. The proposed beamformer not only considers the norm bounded uncertainties in the desired and received signal covariance matrices, but also includes an additional positive semidefinite constraint on the desired signal covariance matrix. Based on the worst-case performance optimization criterion, a computationally simple closed-form weight vector is obtained. Simulation results verify the validity and robustness of the proposed beamforming method.

Keywords： Beamforming General-rank Low complexity Positive semidefinite (PSD) constraint Model mismatches

HTML PDF Collect

Hohmann transfer via constrained optimization None

Li XIE, Yi-qun ZHANG, Jun-yan XU

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 11, Pages 1444-1458 doi: 10.1631/FITEE.1800295

Abstract:

Inspired by the geometric method proposed by Jean-Pierre MAREC, we first consider the Hohmann transfer problem between two coplanar circular orbits as a static nonlinear programming problem with an inequality constraint. By the Kuhn-Tucker theorem and a second-order sufficient condition for minima, we analytically prove the global minimum of the Hohmann transfer. Two sets of feasible solutions are found: one corresponding to the Hohmann transfer is the global minimum and the other is a local minimum. We next formulate the Hohmann transfer problem as boundary value problems, which are solved by the calculus of variations. The two sets of feasible solutions are also found by numerical examples. Via static and dynamic constrained optimizations, the solution to the Hohmann transfer problem is re-discovered, and its global minimum is analytically verified using nonlinear programming.

Keywords： Hohmann transfer Nonlinear programming Constrained optimization Calculus of variations

HTML PDF Collect

Green Strategy of Industrial Development in the Qinba Mountain Area under Ecological and Environmental Limitations

Xu Delong,Li Hui,Zhou Yuan,Cao Yunlong,Miao Jinxiang and Sun Jingwei

Strategic Study of CAE 2016, Volume 18, Issue 5, Pages 68-73 doi: 10.15302/J-SSCAE-2016.05.010

Abstract:

As the main national ecological function area and the biggest poverty alleviation area, the Qinba Mountain Area is facing the arduous task of ecological protection and the urgent need for improving people's livelihood. Based on the analysis of the present situation and the problems of industrial development in the Qinba Mountain Area, together with the advantages of local resources and environment, this paper proposes an overall perspective, specific strategies, and safeguard measures on how to realize the green development, transformation, and upgrading of the industries in this area under ecological and environmental limitations, which will provide reference for the future development of regional industries in this area.

Keywords： the Qinba Mountain Area environmental limitations industry green development

HTML PDF Collect

An oversampling approach for mining program specifications None

Deng CHEN, Yan-duo ZHANG, Wei WEI, Rong-cun WANG, Xiao-lin LI, Wei LIU, Shi-xun WANG, Rui ZHU

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 6, Pages 737-754 doi: 10.1631/FITEE.1601783

Abstract: Automatic protocol mining is a promising approach for inferring accurate and complete API protocols. However, just as with any data-mining technique, this approach requires sufficient training data (object usage scenarios). Existing approaches resolve the problem by analyzing more programs, which may cause significant runtime overhead. In this paper, we propose an inheritance-based oversampling approach for object usage scenarios (OUSs). Our technique is based on the inheritance relationship in object-oriented programs. Given an object-oriented program , generally, the OUSs that can be collected from a run of are not more than the objects used during the run. With our technique, a maximum of times more OUSs can be achieved, where is the average number of super-classes of all general OUSs. To investigate the effect of our technique, we implement it in our previous prototype tool, ISpecMiner, and use the tool to mine protocols from several real-world programs. Experimental results show that our technique can collect 1.95 times more OUSs than general approaches. Additionally, accurate and complete API protocols are more likely to be achieved. Furthermore, our technique can mine API protocols for classes never even used in programs, which are valuable for validating software architectures, program documentation, and understanding. Although our technique will introduce some runtime overhead, it is trivial and acceptable.

Keywords： Object usage scenario API protocol mining Program temporal specification mining Oversampling

HTML PDF Collect

Optimal multi-degree reduction of C-Bézier surfaces with constraints Article

Lian ZHOU, Xin-hui LIN, Hong-yan ZHAO, Jun CHEN

Frontiers of Information Technology & Electronic Engineering 2017, Volume 18, Issue 12, Pages 2009-2016 doi: 10.1631/FITEE.1700458

Abstract: We propose an optimal approach to solve the problem of multi-degree reduction of C-Bézier surfaces in the norm with prescribed constraints. The control points of the degree-reduced C-Bézier surfaces can be explicitly obtained by using a matrix operation that is based on the transfer matrix of the C-Bézier basis. With prescribed boundary constraints, this method can be applied to piecewise continuous patches or to a single patch with the combination of surface subdivision. The resulting piecewise approximating patches are globally G1 continuous. Finally, numerical examples are presented to show the effectiveness of the method.

Keywords： C-Bé zier surfaces Degree reduction Boundary constraints

HTML PDF Collect

Title Author Date Type Operation

Optimal two-impulse space interception with multiple constraints

Li Xie, Yi-qun Zhang, Jun-yan Xu,lixie@ncepu.edu.cn,yiqunzhang@hotmail.com,junyan_Xu@sina.cn

Journal Article

Finite-time formation control for first-order multi-agent systems with region constraints

Zhengquan Yang, Xiaofang Pan, Qing Zhang, Zengqiang Chen,zquanyang@163.com,1219006322@qq.com,qz120168@hotmail.com,chenzq@nankai.edu.cn

Journal Article

Dual-constraint burst image denoising method

Dan ZHANG, Lei ZHAO, Duanqing XU, Dongming LU,cszhd@zju.edu.cn,cszhl@zju.edu.cn,xdq@zju.edu.cn,ldm@zju.edu.cn

Journal Article

A Study About IC and IR in Principal-gent RelationshipUnder the Engineer Supervision Institution

Qin Xuan

Journal Article

Distributed optimization based on improved push-sum framework for optimization problem with multiple local constraints and its application in smart grid

徐谦,俞楚天,袁翔,韦梦立,刘洪喆

Journal Article

ApproximateGaussian conjugacy: parametric recursive filtering under nonlinearity,multimodality, uncertainty, and constraint, and beyond

Tian-cheng LI, Jin-ya SU, Wei LIU, Juan M. CORCHADO

Journal Article

A multi-sensor-system cooperative scheduling method for ground area detection and target tracking

Yunpu ZHANG, Qiang FU, Ganlin SHAN

Journal Article

Pulse Transiently Chaotic Neural Network for Nonlinear Constrained Optimization

Li Ying,Cao Hongzhao,Hu Yunchang,Shang Xiuming

Journal Article

Vibration-Driven Microrobot Positioning Methodologies for Nonholonomic Constraint Compensation