Search results

The purpose of this paper is to propose an attitude control algorithm for spacecraft with geometric constraints.

The geometric constraint is reformulated as a quadratic form when quaternion is used as attitude parameter, then the constraint is proved to be nonconvex and is further transformed to a convex one. By designing a new constraint formulation to satisfy the real constraint in the predictive horizon, the attitude control problem is reshaped to a convex planning problem which is based on receding horizon control.

The proposed algorithm is more effective in handling geometric constraints than previous research which used single step planning control.

With novel improvements to current methods for steering spacecraft from one attitude to another with geometric constraints, great attitude maneuver path can be achieved to protect instruments and meanwhile satisfy mission requirements.

The attitude control algorithm in this paper is designed especially for the satisfaction of geometric constraints in the process of attitude maneuver of spacecraft. By the application of this algorithm, the security of certain optical instruments, which is critical in an autonomous system, can be further assured.

Most of the redundant dual-arm robots are singular free, dexterous and collision free compared to other robotic arms. This paper aims to analyse the workspace of redundant arms to study the manipulability. Furthermore, multi-layer perceptron (MLP) algorithm is used to determine the various joint parameters of both the upper body redundant arms. Trajectory planning of robotic arms is carried out with the help of inverse solutions obtained from the MLP algorithm.

In this paper, the kinematic equations are derived from screw theory approach and inverse kinematic solutions are determined using MLP algorithm. Levenberg–Marquardt (LM) and Bayesian regulation (BR) techniques are used as the backpropagation algorithms. The results from two backpropagation techniques are compared for determining the prediction accuracy. The inverse solutions obtained from the MLP algorithm are then used to optimize the cubic spline trajectories planned for avoiding collision between arms with the help of convex optimization technique. The dexterity of the redundant arms is analysed with the help of Cartesian workspace of arms.

Dexterity of redundant arms is analysed by studying the voids and singular spaces present inside the workspace of arms. MLP algorithms determine unique solutions with less computational effort using BR backpropagation. The inverse solutions obtained from MLP algorithm effectively optimize the cubic spline trajectory for the redundant dual arms using convex optimization technique.

Most of the MLP algorithms used for determining the inverse solutions are used with LM backpropagation technique. In this paper, BR technique is used as the backpropagation technique. BR technique converges fast with less computational time than LM method. The inverse solutions of arm joints for traversing optimized cubic spline trajectory using convex optimization technique are computed from the MLP algorithm.

This paper aims to provide a solution to the first phase of a force-controlled circular Peg-In-Hole assembly using an industrial robot. The paper suggests motion planning of the robot’s end-effector so as to perform Peg-In-Hole search with minimum a priori information of the working environment.

The paper models Peg-In-Hole search problem as a problem of finding the minima in depth profile for a particular assembly. Thereafter, various optimization techniques are used to guide the robot to locate minima and complete the hole search. This approach is inspired by a human’s approach of searching a hole by moving peg in various directions so as to search a point of maximum insertion which is same as the minima in depth profile.

The usage of optimization techniques for hole search allows the robot to work with minimum a priori information of the working environment. Also, the iterative nature of the techniques adapts to any disturbance during assembly.

The techniques discussed here are quite useful if a force-controlled assembly needs to be performed in a highly unknown environment and also when the assembly setup can get disturbed in between.

The concept is original and provides a non-conventional use of optimization techniques, not for optimization of some process directly but for an industrial robot’s motion planning.

In this paper, an online convex optimization method for the exoatmospheric ascent trajectory of space interceptors is proposed. The purpose of this paper is to transform the original trajectory optimization problem into a sequence of convex optimization subproblems.

For convenience in calculating accuracy and efficiency, the complex nonlinear terminal orbital elements constraints are converted into several quadratic equality constraints, which can be better computed by a two-step correction method during the iteration. First, the nonconvex thrust magnitude constraint is convexified by the lossless convexification technique. Then, discretization and successive linearization are introduced to transform the original problem into a sequence of one convex optimization subproblem, considering different flight phases. Parameters of trust-region and penalty are also applied to improve the computation performance. To correct the deviation in real time, the iterative guidance method is applied before orbit injection.

Numerical experiments show that the algorithm proposed in this paper has good convergence and accuracy. The successive progress can converge in a few steps and 3–4 s of CPU time. Even under engine failure or mission change, the algorithm can yield satisfactory results.

The convex optimization method presented in this paper is expected to generate a reliable optimal trajectory rapidly in different situations and has great potential for onboard applications of space interceptors.

The originality of this paper lies in the proposed online trajectory optimization method and guidance algorithm of the space inceptors, especially for onboard applications in emergency situations.

For robot motion planning there exists a large number of different algorithms, each appropriate for a certain domain, and the right choice of planner depends on the specific use case. The purpose of this paper is to consider the application of bin picking and benchmark a set of motion planning algorithms to identify which are most suited in the given context.

The paper presents a selection of motion planning algorithms and defines benchmarks based on three different bin-picking scenarios. The evaluation is done based on a fixed set of tasks, which are planned and executed on a real and a simulated robot.

The benchmarking shows a clear difference between the planners and generally indicates that algorithms integrating optimization, despite longer planning time, perform better due to a faster execution.

The originality of this work lies in the selected set of planners and the specific choice of application. Most new planners are only compared to existing methods for specific applications chosen to demonstrate the advantages. However, with the specifics of another application, such as bin picking, it is not obvious which planner to choose.

This study explores the characteristics of female space evolution in Korean vernacular houses in the Yanbian region of China. In addition, it discusses the influence of social logic on the evolution of female spaces.

This study utilises space syntax methodology to examine the evolution of female spaces in Korean vernacular houses in terms of connectivity value, step depth and integration value. Furthermore, it conducts an analytical exploration of social logic based on the evolutionary characteristics of female space.

The findings elucidate the evolutionary characteristics of the spatial configuration of female spaces in Korean vernacular houses, with differential changes in connectivity, a gradual tendency towards openness and simplicity and increased accessibility and centrality. This reflects the changing spatial needs of Korean women brought about by changes in lifestyle, consciousness, social status and family structure.

This study provides perspectives and insights into the vernacular architecture and architectural sociology of ethnic minorities in regions of China and Asia. Furthermore, it can provide relevant construction organisations with a more intuitive understanding of Korean vernacular houses and a reference for future house renewal and construction in the Yanbian region.

Although many studies have investigated various aspects of Korean vernacular houses and female spaces, none have examined the influence of social logical changes on the evolution of female spaces in Korean vernacular houses. Thus, this study is valuable and novel.

In this study, to maximize returns and minimize investment risk, an attempt was made to form an optimal portfolio under conditions where the capital market has a price bubble. According to the purpose, the research was of the applied type, in terms of data, quantitative and postevent, and in terms of the type of analysis, it was of the descriptive-correlation type. Sequence, skewness and kurtosis tests were used to identify the months with bubbles from 2015 to 2021 in the Tehran Stock Exchange. After identifying the bubble courses, artificial bee colony meta-heuristic and invasive weed algorithms were used to optimize the portfolio. The purpose of this paper is to address these issues.

The existence of bubbles in the market, especially in the capital market, can prevent the participation of investors in the capital market process and the correct allocation of financial resources for the economic development of the country. However, due to the goal of investors to achieve a portfolio of high returns with the least amount of risk, there is need to pay attention to these markets increases.

The results identify 14 periods of price bubbles during the study period. Additionally, stock portfolios with maximum returns and minimum risk were selected for portfolio optimization. According to the results of using meta-heuristic algorithms to optimize the portfolio, in relation to the obtained returns and risk, no significant difference was observed between the returns and risk of periods with price bubbles in each of the two meta-heuristic algorithms. This study can guide investors in identifying bubble courses and forming an optimal portfolio under these conditions.

One of the limitations of this research is the non-generalizability of the findings to stock exchanges of other countries and other time periods due to the condition of the price bubble, as well as other companies in the stock market due to the restrictions considered for selecting the statistical sample.

This study intends to form an optimal stock portfolio in a situation where the capital market suffers from a price bubble. This study provides an effective and practical solution for investors in the field of stock portfolio optimization.

The purpose of this paper is to focus on the local minima issue encountered in motion planning by the artificial potential field (APF) method, investigate the currently existing approaches and analyze four types of previous methods. Based on the conclusions of analysis, this paper presents an improved wall‐following approach for real‐time application in mobile robots.

In the proposed method, new switching conditions among various behaviors are reasonably designed in order to guarantee the reliability and the generality of the method. In addition, path memory is incorporated in this method to enhance the robot's cognition capability to the environment. Therefore, the new method greatly weakens the blindness of decision making of robot and it is very helpful to select appropriate behaviors facing to the changeable situation. Comparing with the previous methods which are normally considering specific obstacles, the effectiveness of this proposed method for the environment with convex polygon‐shaped obstacles has been theoretically proved. The simulation and experimental results further demonstrate that the proposed method is adaptable for the environment with convex polygon‐shaped obstacles or non‐convex polygon‐shaped obstacles. It has more widely generality and adaptiveness than other existed methods in complicated unknown environment.

The proposed method can effectively realize real time motion planning with high reliability and generality. The cognition capability of mobile robot to the environment can be improved in order to adapt to the changeable situation. The proposed method can be suitable to more complex unknown environment. It is more applicable for actual environment comparing with other traditional APF methods.

This paper has widely investigated the currently existed approaches and analyzes deeply on four types of traditional APF methods adopted for real time motion planning in unknown environment with simulation works. Based on the conclusions of analysis, this paper presents an improved wall‐following approach. The proposed method can realize real time motion planning considering more complex environment with high reliability and generality. The simulation and experimental results further demonstrate that the proposed method is adaptable for the environment with convex polygon‐shaped obstacles or non‐convex polygon‐shaped obstacles. It has more widely generality and adaptiveness than other existed methods in complicated unknown environment.

This paper aims to find an objects representation scheme with high precision and to compute the objects’ separation distance effectively in final analysis. Proximity queries have been used widely in robot trajectory planning, automatic assembly planning, virtual surgery and many other applications. The core of proximity query is the precise computation of (minimum) separation distance in narrow phase, and specific object representation scheme corresponds to different methods of separation distance computation.

In this paper, a second-order cone programming (SOCP)-based (minimum) separation distance computation algorithm was proposed. It treats convex superquadrics, descriptive primitives of complex object as the study objects. The separation distance between two convex superquadrics was written as a general nonlinear programming (NLP) problem with superquadric constraints and then transformed into an SOCP problem with the method of conic formulation of superquadric constraints. Finally, a primal-dual interior point method embedded in MOSEK was used for solving the SOCP problem.

The proposed algorithm achieved exact separation distance computation between convex superquadrics, with a relative error of 10-6. It is particularly suitable for proximity queries in narrow phase of static collision detection algorithms. Further, the proposed algorithm achieved continuous collision detection between rectilinear translation superquadrics.

The proposed algorithm in narrow phase of static collision detection algorithms makes objects’ separation distance effectively computed. Proximity queries are easy and more accurate to perform in this way.

The purpose of this paper is to develop a computationally efficient and generally applicable measure for a pipe routing problem which decides the pipe paths and affects the pipe assembly feasibility. By imitating human thinking in pipe assembly planning, human's experience and intuition are quantified and applied in the pipe routing algorithm.

Human's imaginal thinking is simulated with procedures of knowledge representation, pattern recognition, and logical deduction; the algorithm transforms the physical obstacles and constraints into 3D pipe routing space and then into 2D planar projection, by using convex hull algorithm onto the projection, the shortest pipe route is found efficiently.

A novel pipe assembly planning algorithm by imitating human imaginal thinking is presented, which effectively solved the problem of conceiving the shortest pipe route in 3D space with obstacles and constraints.

The application of the algorithm in assembly planning of an aircraft engine pipe system is demonstrated. The algorithm can also be used in similar pipe planning problems such as industrial plant pipe planning and submarine pipe system design.

Human's imaginal thinking is introduced into pipe routing algorithm for the first time. By using graphics as the media to transfer the pipe routing information, human's experience and intuition in pipe assembly planning are quantified and computationally applicable.