Search

During the operation of automatic navigation rice transplanter, the accuracy of path tracking is influenced by whether the transplanter can enter the stable state of linear path tracking quickly, thus affecting the operation quality and efficiency. To reduce the time to enter the path tracking stable state and improve the tracking accuracy and stability for the rice transplanter, path tracking control method based on variable universe fuzzy control (VUFC) and improved beetle antenna search (BAS) is proposed in this paper. VUFC is applied to achieve adaptive adjustment of the fuzzy universe by dynamically adjusting the quantization and scaling factors according to the variations of errors by the contraction–expansion factor. To solve the problem of setting the contraction–expansion factor in VUFC and real-time performance, an offline parameter optimization method is presented to calculate the optimal contraction–expansion factor by an iterative optimization algorithm in a path tracking simulation model, where the iterative optimization algorithm is the BAS algorithm improved by the isolated niching technique and adaptive step size strategy in this paper. To verify the effectiveness of the proposed path tracking control method, simulation and field linear path tracking experiments were carried out. Experimental results indicate that the proposed method reduces the time of entering the stable state of linear path tracking and improves the accuracy and stability of path tracking compared with the pure pursuit control method. [ABSTRACT FROM AUTHOR]

Design has always been seen as an inherently human activity and hard to automate. It requires a lot of traits that are seldom attributable to machines or algorithms. Consequently, the act of designing is also hard to assess. In particular in an educational context, the assessment of progress of design tasks performed by individuals or teams is difficult, and often only the outcome of the task is assessed or graded. There is a need to better understand, and potentially quantify, design progress. Natural Language Processing (NLP) is one way of doing so. With the advancement in NLP research, some of its models are adopted into the field of design to quantify a design class performance. To quantify and visualize design progress, the NLP models are often deployed to analyze written documentation collected from the class participants at fixed time intervals through the span of a course. This paper will explore several ways of using NLP in assessing design progress, analyze its advantages and shortcomings, and present a case study to demonstrate its application. The paper concludes with some guidelines and recommendations for future development. [ABSTRACT FROM AUTHOR]

The use of topology optimization in the design of fluid dynamics systems is still in its infancy. With the decreasing cost of additive manufacture, the application of topology optimization in the design of structural components has begun to increase. This paper provides a method for using topology optimization to reduce the power dissipation of fluid dynamics systems, with the novelty of it being the first application of stochastic mechanisms in the design of 3D fluid–solid geometrical interfaces. The optimization algorithm uses the continuous adjoint method for sensitivity analysis and is optimized against an objective function for fluid power dissipation. The paper details the methodology behind a vanilla gradient descent approach before introducing stochastic behavior through a minibatch-based system. Both algorithms are then applied to a novel case study for an internal combustion engine's piston cooling gallery before the performance of each algorithm's resulting geometry is analyzed and compared. The vanilla gradient descent algorithm achieves an 8.9% improvement in pressure loss through the case study, and this is surpassed by the stochastic descent algorithm which achieved a 9.9% improvement, however this improvement came with a large time cost. Both approaches produced similarly unintuitive geometry solutions to successfully improve the performance of the cooling gallery. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithm to navigate robots in dynamically cluttered environments. The proposed algorithm uses basic concepts of space attraction (hence the term Agoraphilic) to navigate robots through dynamic obstacles. The new algorithm in this paper is an advanced development of the original Agoraphilic navigation algorithm that was only able to navigate robots in static environments. The Agoraphilic algorithm does not look for obstacles (problems) to avoid but rather for a free space (solutions) to follow. Therefore, it is also described as an optimistic navigation algorithm. This algorithm uses only one attractive force created by the available free space. The free-space concept allows the Agoraphilic algorithm to overcome inherited challenges of general navigation algorithms. However, the original Agoraphilic algorithm has the limitation in navigating robots only in static, not in dynamic environments. The presented algorithm was developed to address this limitation of the original Agoraphilic algorithm. The new algorithm uses a developed object tracking module to identify the time-varying free spaces by tracking moving obstacles. The capacity of the algorithm was further strengthened by the new prediction module. Future space prediction allowed the algorithm to make decisions considering future growing/diminishing free spaces. This paper also includes a bench-marking study of the new algorithm compared with a recently published APF-based algorithm under a similar operating environment. Furthermore, the algorithm was validated based on experimental tests and simulation tests. [ABSTRACT FROM AUTHOR]

In this paper, we give an explicit computable algorithm for the Zelevinsky–Aubert duals of irreducible representations of $p$ -adic symplectic and odd special orthogonal groups. To do this, we establish explicit formulas for certain derivatives and socles. We also give a combinatorial criterion for the irreducibility of certain parabolically induced representations. [ABSTRACT FROM AUTHOR]

We present the Kripke-style modal type theory, Mint, which combines dependent types and the necessity modality. It extends the Kripke-style modal lambda-calculus by Pfenning and Davies to the full Martin-Löf type theory. As such it encompasses dependently typed variants of system K , T , K 4, and S 4. Further, Mint seamlessly supports a full universe hierarchy, usual inductive types, and large eliminations. In this paper, we give a modular sound and complete normalization-by-evaluation (NbE) proof for Mint based on an untyped domain model, which applies to all four aforementioned modal systems without modification. This NbE proof yields a normalization algorithm for Mint, which can be directly implemented. To further strengthen our results, our models and the NbE proof are fully mechanized in Agda and we extract a Haskell implementation of our NbE algorithm from it. [ABSTRACT FROM AUTHOR]

The repetitive motion planning movements of the redundant manipulator will cause oscillations and unintended swings of joints, which increase the risk of collisions between the manipulator and its surroundings. Motivated by this phenomenon, this paper presents an inverse kinematics algorithm for the spherical-revolute-spherical manipulator to solve the paradox raised by joint-drift and control the pose with no swing of the elbow. This algorithm takes the joint Cartesian positions set as the intermediary and divides the inverse solution process into two mapping processes within joint limits. Simulations are executed to evaluate this algorithm, and the results show this algorithm is applicable to repetitive motion planning and is capable of producing superior configurations based on its real-time ability and stable solve rate. Experiments using the 7-degree-of-freedom spherical-revolute-spherical manipulator demonstrate the effectiveness of this algorithm to remedy the joint-drift and elbow swing compared to Kinematics and Dynamics Library and TRAC-IK. [ABSTRACT FROM AUTHOR]

This paper presents a formulation of snapshot positioning as a mixed-integer least-squares problem. In snapshot positioning, one estimates a position from code-phase (and possibly Doppler-shift) observations of global navigation satellite system (GNSS) signals without knowing the time of departure (timestamp) of the codes. Solving the problem allows a receiver to determine a fix from short radio-frequency snapshots missing the timestamp information embedded in the GNSS data stream. This is used to reduce the time to first fix in some receivers, and it is used in certain wildlife trackers. This paper presents two new formulations of the problem and an algorithm that solves the resulting mixed-integer least-squares problems. We also show that the new formulations can produce fixes even with huge initial errors, much larger than permitted in Van Diggelen's widely-cited coarse-time navigation method. [ABSTRACT FROM AUTHOR]

This paper considers the task allocation problem under the requirement that the assignments of some critical tasks must be maximized when the network capacity cannot accommodate all tasks due to the limited capacity for each unmanned aerial vehicle (UAV). To solve this problem, this paper proposes an extended performance impact algorithm with critical tasks (EPIAC) based on the traditional performance impact algorithm. A novel task list resizing phase is developed in EPIAC to deal with the constraint on the limited capacity of each UAV and maximize the assignments of critical tasks. Numerical simulations demonstrate the outstanding performance of EPIAC compared with other algorithms. [ABSTRACT FROM AUTHOR]

On-orbit servicing and active debris removal missions will rely on the use of unmanned satellite equipped with a manipulator. Capture of the target object will be the most challenging phase of these missions. During the capture manoeuvre, the manipulator must avoid collisions with elements of the target object (e.g., solar panels). The dynamic equations of the satellite-manipulator system must be used during the trajectory planning because the motion of the manipulator influences the position and orientation of the satellite. In this paper, we propose application of the bidirectional rapidly exploring random trees (BiRRT) algorithm for planning a collision-free trajectory of a manipulator mounted on a free-floating satellite. A new approach based on pseudo-velocities method (PVM) is used for construction of nodes of the trajectory tree. Initial nodes of the second tree are selected from the set of potential final configurations of the system. The proposed method is validated in numerical simulations performed for a planar case (3-DoF manipulator). The obtained results are compared with the results obtained with two other trajectory planning methods based on the RRT algorithm. It is shown that in a simple test scenario, the proposed BiRRT PVM algorithm results in a lower manipulator tip position error. In a more difficult test scenario, only the proposed method was able to find a solution. Practical applicability of the BiRRT PVM method is demonstrated in experiments performed on a planar air-bearing microgravity simulator where the trajectory is realised by a manipulator mounted on a mock-up of the free-floating servicing satellite. [ABSTRACT FROM AUTHOR]

To eliminate the effect of ocean currents for optimal path planning for unmanned underwater vehicles (UUVs) in the underwater environment, an intelligent algorithm is designed and proposed in this paper. The algorithm consists of two parts: an artificial potential field-based algorithm that derives the shortest path and avoids collision accidents; and an adjusting function that eliminates the effect of ocean currents. The planning results of the intelligent algorithm are presented in detail, and compared with the conventional algorithm that does not consider the effect of currents. The effectiveness of the optimised path planning method given in this paper is proved. [ABSTRACT FROM AUTHOR]

Improving the accuracy and robustness of deep neural nets (DNNs) and adapting them to small training data are primary tasks in deep learning (DL) research. In this paper, we replace the output activation function of DNNs, typically the data-agnostic softmax function, with a graph Laplacian-based high-dimensional interpolating function which, in the continuum limit, converges to the solution of a Laplace–Beltrami equation on a high-dimensional manifold. Furthermore, we propose end-to-end training and testing algorithms for this new architecture. The proposed DNN with graph interpolating activation integrates the advantages of both deep learning and manifold learning. Compared to the conventional DNNs with the softmax function as output activation, the new framework demonstrates the following major advantages: First, it is better applicable to data-efficient learning in which we train high capacity DNNs without using a large number of training data. Second, it remarkably improves both natural accuracy on the clean images and robust accuracy on the adversarial images crafted by both white-box and black-box adversarial attacks. Third, it is a natural choice for semi-supervised learning. This paper is a significant extension of our earlier work published in NeurIPS, 2018. For reproducibility, the code is available at https://github.com/BaoWangMath/DNN-DataDependentActivation. [ABSTRACT FROM AUTHOR]

Collision avoidance (COLAV) is a prerequisite for the navigation safety of unmanned surface vehicles (USVs). Since USVs have to avoid obstacles clearly and timely, i.e. the COLAV should be agile, the COLAV algorithm should have low computation complexity and make efficient COLAV decisions. However, balancing between the computation complexity and the COLAV decision optimality is still intractable at present. This paper innovatively proposes a COLAV algorithm for USVs by combining the velocity obstacle method with the predictive model method, named the collision shielded model predictive control (CS-MPC) algorithm, such that the agility of USVs COLAV is improved. The runtime of the proposed COLAV algorithm is shortened by shielding the dangerous parts of the search space of the COLAV decisions, and the COLAV decision is efficient with the aid of the accurately predicted motion trajectory by the motion mathematical model of USVs. As such, the USV can safely navigate in complex water areas where multiple vessels and obstacles exist. A series of simulations on a yacht in different kinds of encounter situations were carried out to verify the effectiveness and the agility of the proposed CS-MPC COLAV algorithm. [ABSTRACT FROM AUTHOR]

Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. While most of the existing literature focuses on undirected graphs, directed graphs are very important in practice, giving models for physical, biological or transportation networks, among many other applications. In this paper, we propose a new framework for rigorously studying continuum limits of learning algorithms on directed graphs. We use the new framework to study the PageRank algorithm and show how it can be interpreted as a numerical scheme on a directed graph involving a type of normalised graph Laplacian. We show that the corresponding continuum limit problem, which is taken as the number of webpages grows to infinity, is a second-order, possibly degenerate, elliptic equation that contains reaction, diffusion and advection terms. We prove that the numerical scheme is consistent and stable and compute explicit rates of convergence of the discrete solution to the solution of the continuum limit partial differential equation. We give applications to proving stability and asymptotic regularity of the PageRank vector. Finally, we illustrate our results with numerical experiments and explore an application to data depth. [ABSTRACT FROM AUTHOR]

In order to improve the speed of motion planning, this paper proposes an improved RRTConnect algorithm (SDPS-RRTConnect) based on sparse dead point saved strategy. Combining sparse expansion strategy and dead point saved strategy, the algorithm can reduce the number of collision detection, fast convergence, avoid falling into local minimum, and ensure the completeness of search space. The algorithm is simulated in different environments. The results show that in complex environments, the sparse dead point saved strategy plays a good effect. In simple environments, the greedy connection strategy works well. Compared with the standard RRT algorithm, the standard RRTConnect algorithm, and the SDPS-RRT algorithm, the SDPS-RRTConnect algorithm has the shortest planning time, and it is suitable for both simple and complex environments. The 500 experiments show that the algorithm has strong robustness. The actual robot experiments show that the path planned by SDPS-RRTConnect algorithm is effective. [ABSTRACT FROM AUTHOR]

To solve the problem of spacecraft attitude manoeuvre planning under dynamic multiple mandatory pointing constraints and prohibited pointing constraints, a systematic attitude manoeuvre planning approach is proposed that is based on improved policy gradient reinforcement learning. This paper presents a succinct model of dynamic multiple constraints that is similar to a real situation faced by an in-orbit spacecraft. By introducing return baseline and adaptive policy exploration methods, the proposed method overcomes issues such as large variances and slow convergence rates. Concurrently, the required computation time of the proposed method is markedly reduced. Using the proposed method, the near optimal path of the attitude manoeuvre can be determined, making the method suitable for the control of micro spacecraft. Simulation results demonstrate that the planning results fully satisfy all constraints, including six prohibited pointing constraints and two mandatory pointing constraints. The spacecraft also maintains high orientation accuracy to the Earth and Sun during all attitude manoeuvres. [ABSTRACT FROM AUTHOR]

This paper proposes a kinematic obstacle avoidance algorithm for Space hyper-redundant manipulators, and its basic idea is to use a static and a dynamic curve to constrain the macroshape of the manipulators simultaneously. The static curve is constructed based on a traditional rapidly exploring random tree algorithm, and a backbone curve is utilized as the dynamic curve. For these two curves, two novel shape control methods are proposed to accomplish the shape constraining process. Finally, we verify the reliability and effectiveness of our algorithm through simulations. [ABSTRACT FROM AUTHOR]

The user's gaze can provide important information for human–machine interaction, but the analysis of manual gaze data is extremely time-consuming, inhibiting wide adoption in usability studies. Existing methods for automated areas of interest (AOI) analysis cannot be applied to tangible products with a screen-based user interface (UI), which have become ubiquitous in everyday life. The objective of this paper is to present and evaluate a method to automatically map the user's gaze to dynamic AOIs on tangible screen-based UIs based on computer vision and deep learning. This paper presents an algorithm for automated Dynamic AOI Mapping (aDAM), which allows the automated mapping of gaze data recorded with mobile eye tracking to the predefined AOIs on tangible screen-based UIs. The evaluation of the algorithm is performed using two medical devices, which represent two extreme examples of tangible screen-based UIs. The different elements of aDAM are examined for accuracy and robustness, as well as the time saved compared to manual mapping. The break-even point for an analyst's effort for aDAM compared to manual analysis is found to be 8.9 min gaze data time. The accuracy and robustness of both the automated gaze mapping and the screen matching indicate that aDAM can be applied to a wide range of products. aDAM allows, for the first time, automated AOI analysis of tangible screen-based UIs with AOIs that dynamically change over time. The algorithm requires some additional initial input for the setup and training, but analyzed gaze data duration and effort is only determined by computation time and does not require any additional manual work thereafter. The efficiency of the approach has the potential for a broader adoption of mobile eye tracking in usability testing for the development of new products and may contribute to a more data-driven usability engineering process in the future. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper presents a non-model-based collision detection algorithm for robots without external sensors and with closed control architecture. A reference signal of repetitive motion is recorded from the robot operation. To detect collisions, the reference is compared with measurements from the robot. One of the key contributions is a novel approach to optimal matching of compared signals, which is ensured by the newly developed modified Dynamic Time Warping (mDTW) method presented in this paper. One of the main improvements of the mDTW is that it enables comparing a signal with the most similar section of the other signal. Partial matching also enables online application of time warping principles and reduces the time and computation resources needed to perform matching. In addition to mDTW, two complementary decision rules are developed to identify collisions. The first rule, based on the absolute difference between compared matched samples, uses statistically determined thresholds to perform rapid detection of unambiguous collisions. The second rule is based on Eigen values of the covariance matrix of matched samples, and it employs its higher sensitivity to detect collisions with lower intensity. Results from experimental validation of the proposed collision algorithm on two industrial robots are shown. [ABSTRACT FROM AUTHOR]

This paper presents an efficient water cycle algorithm based on the processes of water cycle with movement of streams and rivers in to the sea. This optimization algorithm is applied to obtain the optimal feasible path with minimum travel duration during motion planning of both single and multiple humanoid robots in both static and dynamic cluttered environments. This technique discards the rainfall process considering falling water droplets forming streams during raining and the process of flowing. The flowing process searches the solution space and finds the more accurate solution and represents the local search. Motion planning of humanoids is carried out in V-REP software. The performance of proposed algorithm is tested in experimental scenario under laboratory conditions and shows the developed algorithm performs well in terms of obtaining optimal path length and minimum time span of travel. Here, navigational analysis has been performed on both single as well as multiple humanoid robots. Statistical analysis of results obtained from both simulation and experimental environments is carried out for both single and multiple humanoids, along with the comparison with another existing optimization technique that indicate the strength and effectiveness of the proposed water cycle algorithm. [ABSTRACT FROM AUTHOR]

The application of machine-learning technologies to medical practice promises to enhance the capabilities of healthcare professionals in the assessment, diagnosis, and treatment, of medical conditions. However, there is growing concern that algorithmic bias may perpetuate or exacerbate existing health inequalities. Hence, it matters that we make precise the different respects in which algorithmic bias can arise in medicine, and also make clear the normative relevance of these different kinds of algorithmic bias for broader questions about justice and fairness in healthcare. In this paper, we provide the building blocks for an account of algorithmic bias and its normative relevance in medicine. [ABSTRACT FROM AUTHOR]

Real-time localization is an important mission for self-driving cars and it is difficult to achieve precise pose information in dynamic environments. In this paper, a novel localization method is proposed to estimate the pose of self-driving cars using a 3D-LiDAR sensor. First, the multi-frame curb features and laser intensity features are extracted. Meanwhile, based on the high-precision curb map generated offline, obstacles on road are detected using region segmentation methods and their features are removed. Furthermore, a map-matching method is proposed to match the features to the map, a robust iterative closest point algorithm is utilized to deal with curb features along with a probability search method dealing with intensity features. Finally, two separate Kalman filters are used to fuse the low-cost global positioning systems and map-matching results. Both offline and online experiments are carried out in dynamic environments and the results demonstrate the accuracy and robustness of the proposed method. [ABSTRACT FROM AUTHOR]

Conceptual design is a key stage of product design and has received increasing attention in recent years. However, this stage is characterized by limited information, large uncertainty, and multidisciplinary aspects. Thus, increased workload and time cost are associated with conceptual design information acquisition; sometimes, it is difficult to develop novel solutions and the feasibility of the solutions obtained according to these limited and uncertain information is difficult to guarantee. Genetics-based design (GBD) is an effective approach to develop novel solutions and improve the reuse of knowledge, which is consistent with the goal of the conceptual design process. Product-gene acquisition is the premise and basis of GBD. At present, there are few reported studies in this area; most of the existing works are constrained by the structural aspects of the acquisition process, and there are limited studies on specific implementation techniques. To explore the specific implementation technologies of product-gene acquisition, an intelligent acquisition method based on K -means clustering and mutual information-based feature selection algorithm is proposed in this paper. The product genes defined in this paper are key product information that determines the nature of the product and influences the conceptual design process. Thus, solutions obtained according to them are more feasible than that based on limited and uncertain information. An illustrative example is presented. The results show that the proposed method can achieve intelligent acquisition of product genes to a certain extent. Further, the proposed method will allow designers to quickly search for the corresponding product genes when performing similar functional design tasks. [ABSTRACT FROM AUTHOR]

Summary: Humanoid robots (HR) equipped with a sophisticated facial character analysis (FCA) algorithm can able to initiate crucial improvements in human–robot interactions. This paper, for the first time in the literature, proposes a three-stage FCA algorithm for the HR. At the initial stage of this algorithm, the HR detects the face with the Viola–Jones algorithm, and then important facial distance measurements are obtained with the geometric-based facial distance measurement technique. Finally, the measured facial distances are evaluated with the physiognomy science to reveal the characteristic properties of a person. Even though the proposed algorithm can be implemented to all HR, in this paper, it has been specifically applied to NAO HR. The reliability of the developed FCA algorithm is verified by analyzing each terminal decision about the character and its connection with the measured facial distances in the anatomy science. [ABSTRACT FROM AUTHOR]

In this paper, adaptive noise estimation is used along with a previously proposed Huber-based robust algorithm for cooperative localisation of Autonomous Underwater Vehicles (AUVs). The Huber-based robust cooperative localisation algorithm named Huber-based Iterative Divided Difference Filtering (HIDDF), proposed in our previous work, effectively achieved a robust result against abnormal measurement noise, enhanced the stability of the filtering algorithm and improved the performance of cooperative localisation state estimation. However, its performance could be significantly further improved if it could estimate the system's noise statistical properties online in real time and then adaptively adjust the filtering gain matrix accordingly. In this paper, a novel adaptive noise estimation algorithm is proposed based on a covariance matching method. The proposed algorithm is suitable for adaptively estimating Gaussian and non-Gaussian measurement as well as process noise. The efficacy of the proposed algorithm has been verified through simulation results. In order to further verify the effectiveness of the proposed algorithm in practical systems, lake tests were conducted. Then, based on offline test data, the performance of the cooperative positioning algorithm under dual-pilot and single-pilot schemes was simulated. The advantages and feasibility of the algorithm are analysed and compared through performance comparison. Cooperative localisation accuracy of the previously proposed Huber-based robust algorithm has been enhanced significantly when used with the proposed adaptive noise estimation algorithm. [ABSTRACT FROM AUTHOR]

To improve the uniformity of coating thickness and spraying efficiency, new point cloud modeling and slicing algorithm are proposed to deal with free-form surfaces for the spray painting robot in this paper. In the process of point cloud modeling, the edge preservation algorithm is firstly presented to avoid damaging the edge characteristic of the point cloud model. For the spraying gun, the coating deposition model on the free-form surface is determined on the basis of the elliptic double β distribution model. Then, the grid projection algorithm is proposed to obtain grid points between adjacent slices on the free-form surface. Based on this, the analytical solution for calculating the coating thickness at each grid point is obtained. The cross-section contour points are obtained by intercepting the point cloud model with several parallel slices, which is important for the trajectory planning of the spray painting robot. Finally, the uniformity of coating thickness is optimized in terms of the moving speed of the spraying gun and the slice thickness. The simulation and numerical experiment results show that the uniformity of coating thickness and spraying efficiency are improved using the proposed point cloud modeling and slicing algorithm. [ABSTRACT FROM AUTHOR]

SUMMARY: Visual tracking is an essential building block for target tracking and capture of the underwater vehicles. On the basis of remotely autonomous control architecture, this paper has proposed an improved kernelized correlation filter (KCF) tracker and a novel fuzzy controller. The model is trained to learn an online correlation filter from a plenty of positive and negative training samples. In order to overcome the influence from occlusion, the improved KCF tracker has been designed with an added self-discrimination mechanism based on system confidence uncertainty. The novel fuzzy logic tracking controller can automatically generate and optimize fuzzy rules. Through Q-learning algorithm, the fuzzy rules are acquired through the estimating value of each state action pairs. An S surface based fitness function has been designed for the improvement of learning based particle swarm optimization. Tank and channel experiments have been carried out to verify the proposed tracker and controller through pipe tracking and target grasp on the basis of designed open frame underwater vehicle. [ABSTRACT FROM AUTHOR]

The layout of seafloor datum points is the key to constructing the seafloor geodetic datum network, and a reliable underwater positioning model is the prerequisite for achieving precise deployment of the datum points. The traditional average sound speed positioning model is generally adopted in underwater positioning due to its simple and efficient algorithm, but it is sensitive to incident angle related errors, which lead to unreliable positioning results. Based on the relationship between incident angle and sound speed, the sound speed function model considering the incident angle has been established. Results show that the accuracy of positioning is easily affected by errors related to the incident angle; the new average sound speed correction model based on the incident angle proposed in this paper is used to significantly improve the underwater positioning accuracy. [ABSTRACT FROM AUTHOR]

There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides evidence that such generalizations are readily obtainable from suitably formulated hierarchical versions of the principles used in the original proofs. By collecting such principles, we prove hierarchical versions of Mostowski's theorem on independent formulae, Kripke's theorem on flexible formulae, Woodin's theorem on the universal algorithm, and a few related results. As a corollary, we obtain the expected result that the formula expressing " $\mathrm {T}$ is $\Sigma _n$ -ill" is a canonical example of a $\Sigma _{n+1}$ formula that is $\Pi _{n+1}$ -conservative over $\mathrm {T}$. [ABSTRACT FROM AUTHOR]

In this paper, a new hybrid fault-tolerant control (FTC) strategy based on nonsingular fast integral-type terminal sliding mode (NFITSM) and time delay estimation (TDE) is proposed for a Schönflies parallel manipulator. In order to detect, isolate, and accommodate actuator faults, TDE is used as an online fault estimation algorithm. Stability analysis of the closed-loop system is performed using Lyapunov theory. The proposed controller performance is compared with conventional sliding mode and feedback linearization control methods. The obtained results reveal the superiority of the proposed FTC based on TDE and NFITSM. [ABSTRACT FROM AUTHOR]

SUMMARY: A new coverage path planning (CPP) algorithm, namely cell permeability-based coverage (CPC) algorithm, is proposed in this paper. Unlike the most CPP algorithms using approximate cellular decomposition, the proposed algorithm achieves exact coverage with lower coverage overlap compared to that with the existing algorithms. Apart from a formal analysis of the algorithm, the performance of the proposed algorithm is compared with two representative approximate cellular decomposition-based coverage algorithms reported in the literature. Results of demonstrative experiments on a TurtleBot mobile robot within the robot operating system/Gazebo environment and on a Fire Bird V robot are also provided. [ABSTRACT FROM AUTHOR]

To solve the problem of identifying ship model parameters quickly and accurately with the least test data, this paper proposes a nonlinear innovation parameter identification algorithm for ship models. This is based on a nonlinear arc tangent function that can process innovations on the basis of an original stochastic gradient algorithm. A simulation was carried out on the ship Yu Peng using 26 sets of test data to compare the parameter identification capability of a least square algorithm, the original stochastic gradient algorithm and the improved stochastic gradient algorithm. The results indicate that the improved algorithm enhances the accuracy of the parameter identification by about 12% when compared with the least squares algorithm. The effectiveness of the algorithm was further verified by a simulation of the ship Yu Kun. The results confirm the algorithm's capacity to rapidly produce highly accurate parameter identification on the basis of relatively small datasets. The approach can be extended to other parameter identification systems where only a small amount of test data is available. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper deals with motion planning and control problems for a class of partially differentially flat systems. They possess a feature that the derivative of the fiber variable can be represented purely by the base variable and its derivatives. Based on this feature, a Beta function-based motion planning algorithm is proposed with less computational cost compared with the optimal control formulation while providing similar system performance. Then, an adaptive controller is constructed through a function approximation technique-based approach. Finally, the feasibility of the proposed motion planning and control algorithms is verified by simulations. [ABSTRACT FROM AUTHOR]

The accuracy and fault tolerance of filters are directly affected by the filter architecture and algorithm, thus influencing navigation performance. The chi square detection used in the conventional reset federated filter is not sensitive to soft faults, and it is easy to cause the health subsystem to be polluted through information sharing. It is a challenge to design an adaptive reset federated filter to improve the performance of the navigation system. Therefore, taking the Strapdown Inertial Navigation System/Global Positioning System/Celestial Navigation System/Synthetic Aperture Radar (SINS/GPS/CNS/SAR) integrated navigation system as an example, an adaptive federated filter architecture for vector-formed information sharing without a fault isolation module is designed in this paper. The proposed method uses the two-state chi square detection algorithm to calculate the parameters corresponding to each state, making the state with higher accuracy obtain a greater information distribution coefficient. In addition, according to the value of vector-formed information sharing, an adaptive coefficient of measurement noise is designed. This improves the adaptability of the navigation system to soft faults. Simulation results show that the accuracy of the proposed algorithm has the same performance compared with the conventional method under normal circumstances. When the sensor has a soft fault, the adaptive federated filter algorithm proposed in this paper can adaptively adjust the distribution coefficients, eliminate the influence of the fault information and improve the precision of the navigation system. The approach described in this paper can be used in multi-sensor integrated navigation. It will have better performance in engineering applications. [ABSTRACT FROM AUTHOR]

This paper comprehensively investigates the fault exclusion problem in multi-constellation Global Navigation Satellite Systems (GNSS). In future GNSS, the heightened likelihood of fault detection events will cause more interruptions in the continuity of the navigation operation. The main contribution of this paper is to establish the theoretical basis to quantify the contributions of fault events on continuity risk, therefore allowing us to assess the desired exclusion function performance based on specific continuity requirements. Accordingly, a new real-time exclusion algorithm is developed, for which the upper bounds on integrity risks are rigorously derived. Using the new method, performance is comprehensively investigated for two important civil aircraft navigation operations using various numbers of constellations. We show that high service availability can be achieved for both operations. [ABSTRACT FROM AUTHOR]

This paper proposes a dynamic aided inertial navigation method to improve the attitude accuracy for ocean vehicles. The proposed method includes a dynamic identification algorithm and the utilisation of dynamic constraints to derive additional observations. The derived additional observations are used to update the filters and limit the attitude error based on the dynamic knowledge. In this paper, two dynamic conditions, constant speed cruise and quasi-static, are identified and corresponding additional velocity and position observations are derived. Simulation and experimental results show that the proposed method can improve and guarantee the accuracy of the attitude. The method can be used as a backup method to bridge external information outages or unavailability. Both the features of independence of external support and integrity of the Inertial Navigation System (INS) are enhanced. [ABSTRACT FROM AUTHOR]

SUMMARY: Quadrotors are unmanned aerial vehicles with many potential applications ranging from mapping to supporting rescue operations. A key feature required for the use of these vehicles under complex conditions is a technique to analytically solve the problem of trajectory planning. Hence, this paper presents a heuristic approach for optimal path planning that the optimization strategy is based on the indirect solution of the open-loop optimal control problem. Firstly, an adequate dynamic system modeling is considered with respect to a configuration of a commercial quadrotor helicopter. The model predicts the effect of the thrust and torques induced by the four propellers on the quadrotor motion. Quadcopter dynamics is described by differential equations that have been derived by using the Newton–Euler method. Then, a path planning algorithm is developed to find the optimal trajectories that meet various objective functions, such as fuel efficiency, and guarantee the flight stability and high-speed operation. Typically, the necessary condition of optimality for a constrained optimal control problem is formulated as a standard form of a two-point boundary-value problem using Pontryagin's minimum principle. One advantage of the proposed method can solve a wide range of optimal maneuvers for arbitrary initial and final states relevant to every considered cost function. In order to verify the effectiveness of the presented algorithm, several simulation and experiment studies are carried out for finding the optimal path between two points with different objective functions by using MATLAB software. The results clearly show the effect of the proposed approach on the quadrotor systems. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper introduces an intuitive and safe command approach for a quadrotor, where inertial and muscular gestures are used for semi-autonomous flight. A bracelet composed of gyroscopes, accelerometers, and electromyographic sensors is used to detect user gestures, then an algorithm is proposed to interpret the signals as flight commands. The main goal is to provide a wearable, easy-to-handle human–machine interface for users a to safely command this kind of vehicles, even for inexpert operators. Safety measures are incorporated in the scheme to further enhance the user's experience. Experimental tests are performed to validate the proposal. [ABSTRACT FROM AUTHOR]

Obstacle avoidance navigation for an unmanned surface vessel is a research focus for ship autonomy in which the real-time requirement in practical application is very serious, and always necessitates a complicated structure model to guarantee real-time performance. This paper proposes the grid cell activation model to reduce the complexity of modelling and to simplify an obstacle avoidance algorithm. Combined with the goal-oriented probability model to design a dynamic positive-loss-rate expectation evaluation function, it produces the proper strategy for obstacle avoidance. Case studies on multi-obstacle layouts and special circumstances are conducted and presented. The results indicate that the grid cell obstacle avoidance algorithm can effectively implement obstacle avoidance planning and ensure real-time requirements. A comparison with the potential field algorithm is performed, which shows good results and verifies the feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

The bacterial foraging optimisation (BFO) algorithm is a commonly adopted bio-inspired optimisation algorithm. However, BFO is not a proper choice in coping with continuous global path planning in the context of unmanned surface vehicles (USVs). In this paper, a grid partition-based BFO algorithm, named AS-BFO, is proposed to address this issue in which the enhancement is contributed by the involvement of the A* algorithm. The chemotaxis operation is redesigned in AS-BFO. Through repeated simulations, the relative optimal parameter combination of the proposed algorithm is obtained and the most influential parameters are identified by sensitivity analysis. The performance of AS-BFO is evaluated via five size grid maps and the results show that AS-BFO has advantages in USV global path planning. [ABSTRACT FROM AUTHOR]

During pulsar navigation, the high-frequency noise carried by the pulsar profile signal reduces the accuracy of the pulse TOA (Time of Arrival) estimation. At present, the main method to remove signal noise by using wavelet transform is to redesign the function of the threshold and level of wavelet transform. However, the signal-to-noise ratio and other indicators of the filtered signal need to be further optimised, so a more appropriate wavelet basis needs to be designed. This paper proposes a wavelet basis design method based on frequency domain analysis to improve the denoising effect of pulsar signals. This method first analyses the pulsar contour signal in the frequency domain and then designs a Crab pulsar wavelet basis (CPn, where n represents the wavelet basis length) based on its frequency domain characteristics. In order to improve the real-time performance of the algorithm, a wavelet lifting scheme is implemented. Through simulation, this method analyses the pulsar contour signal data at home and abroad. Results show the signal-to-noise ratio can be increased by 4 dB, the mean square error is reduced by 61% and the peak error is reduced by 45%. Therefore, this method has better filtering effect. [ABSTRACT FROM AUTHOR]

The fingerprint positioning (FP) algorithm has been investigated extensively owing to the fact that it can provide a relatively ideal indoor positioning result. However, the effectiveness of the fingerprint algorithm relies on the size of fingerprint database, which prevents the algorithm from being widely applied in practical applications. In this paper, an improved fingerprint algorithm with access point (AP) selection strategy and reference point (RP) selection strategy is proposed to reduce the size of the fingerprint database and improve the positioning accuracy. The experimental results show that the proposed algorithm can reduce the storage size of the fingerprint database by more than 42·64%. Moreover, compared with the FP algorithm, the fingerprint algorithm with segment characteristic distance (FP-SCD) and the fingerprint algorithm with RP selection strategy (FP-RPSS), the average positioning error of the proposed algorithm is reduced by 20·15%, 10·83% and 11·57%, respectively. Therefore, the proposed algorithm has a good application in real positioning scenarios. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper addresses the application of a novel elimination algorithm with a newly developed homotopy continuation method (HCM) for forward kinematics of a specific hybrid modular manipulator known as n-(6UPS). First, the kinematic model of n-(6UPS) was extracted using a homogenous transformation matrix method. Then, a novel algebraic elimination algorithm was developed to transform the highly nonlinear proposed kinematic model into a system of polynomial equations for each module. Next, the HCM is considered to solve the system of equations. Comparison of the results from the proposed approach with experimental data and other methods demonstrates the efficiency of the proposed contribution. [ABSTRACT FROM AUTHOR]

SUMMARY: In this paper, we propose a novel unified framework for virtual guides. The human–robot interaction is based on a virtual robot, which is controlled by the admittance control. The unified framework combines virtual guides, control of the dynamic behavior, and path tracking. Different virtual guides and active constraints can be realized by using dead-zones in the position part of the admittance controller. The proposed algorithm can act in a changing task space and allows selection of the tasks-space and redundant degrees-of-freedom during the task execution. The admittance control algorithm can be implemented either on a velocity or on acceleration level. The proposed framework has been validated by an experiment on a KUKA LWR robot performing the Buzz-Wire task. [ABSTRACT FROM AUTHOR]

We clarify two pointsmade in our commentary (Pezzo&Beckstead, 2020, this issue) on a recent paper by Longoni, Bonezzi, and Morewedge (2019). In both Experiments 1 and 4 from their paper, it is not possible to determine whether accuracy can compensate for algorithm aversion. Experiments 3A-C, however, do show a strong effect of accuracy such that AI that is superior to a human provider is embraced by patients. Many papers, including Longoni et al. tend to minimize the role of this compensatory process, apparently because it seems obvious to the authors (Longoni, Bonezzi, Morewedge, 2020, this issue). Such minimization, however, can lead to (mis)citations in which research that clearly demonstrates a compensatory role of AI accuracy is cited as non-compensatory. [ABSTRACT FROM AUTHOR]

This paper proposes a method to compare the performances of different methods for robust design optimization of computationally demanding models. Its intended usage is to help the engineer to choose the optimization approach when faced with a robust optimization problem. This paper demonstrates the usage of the method to find the most appropriate robust design optimization method to solve an engineering problem. Five robust design optimization methods, including a novel method, are compared in the demonstration of the comparison method. Four of the five compared methods involve surrogate models to reduce the computational cost of performing robust design optimization. The five methods are used to optimize several mathematical functions that should be similar to the engineering problem. The methods are then used to optimize the engineering problem to confirm that the most suitable optimization method was identified. The performance metrics used are the mean value and standard deviation of the robust optimum as well as an index that combines the required number of simulations of the original model with the accuracy of the obtained solution. These measures represent the accuracy, robustness, and efficiency of the compared methods. The results of the comparison show that sequential robust optimization is the method with the best balance between accuracy and number of function evaluations. This is confirmed by the optimizations of the engineering problem. The comparison also shows that the novel method is better than its predecessor is. [ABSTRACT FROM PUBLISHER]

The lane-level map, which contains the lane-level information severely lacking in widely used commercial navigation maps, has become an essential data source for autonomous driving systems. The linking relations between lane-level map and commercial navigation map can facilitate an autonomous driving system mapping information between different applications using different maps. In this paper, an approach is proposed to build the linking relations automatically. The different topology networks are first reconstructed into similar structures. Then, to build the linking relations automatically, the adaptive multi-filter algorithm and forward path exploring algorithm are proposed to detect corresponding junctions and paths, respectively. The approach is validated by two real data sets of more than 150 km of roads, mainly highway. The linking relations for nearly 94% of the total road length have been built successfully. [ABSTRACT FROM AUTHOR]

With the development of sensor technology, sensor nodes are increasingly being used in underwater environments. The strategy presented in this paper is designed to solve the problem of using a limited number of autonomous underwater vehicles (AUVs) to complete tasks such as data collection from sensor nodes when the number of AUVs is less than the number of target sensors. A novel classified self-organising map algorithm is proposed to solve the problem. First, according to the K-means algorithm, targets are classified into groups that are determined by the number of AUVs. Second, according to the self-organising map algorithm, AUVs are matched with groups. Third, each AUV is provided with the accessible order of the targets in the group. The novel classified self-organising map algorithm can be used not only to reduce the total energy consumption in a multi-AUV system, but also to give the most efficient accessible order of targets for AUVs. Results of simulations conducted to prove the applicability of the algorithm are given. [ABSTRACT FROM AUTHOR]

Avoidance of collisions at sea is crucial to navigational safety. In this paper, we use a distributed algorithm to communicate the entire collision avoidance trajectory information for each ship. In each communication, we suggest a new improvement function considering safety and efficiency to identify the avoidance ship in each cycle. Considering the nonlinear collision avoidance trajectory of ships, a new method for calculating the degree of danger using a velocity obstacle algorithm is proposed. Therefore, in each communication, each ship considers the avoidance behaviours of other ships in planning its avoidance trajectory. Additionally, we combine bi-criterion evolution (BCE) and the ant lion optimiser to plan the entire collision avoidance path. Three scenarios are designed to demonstrate the performance of this method. The results show that the proposed method can find a suitable collision-free solution for all ships. [ABSTRACT FROM AUTHOR]

SUMMARY: This paper proposes an adaptive robust impedance control for a single-link flexible arm when it encounters an environment at an unknown intermediate point. First, the intermediate collision point is estimated using a collision detection algorithm. The controller, then, switches from free to constrained motion mode. In the unconstrained motion mode, the exerted force to environment is nearly zero. Thus, the reference trajectory is a prescribed desired trajectory in position control. In the constrained motion mode, the reference trajectory is determined by the desired target dynamic impedance. The simulation results demonstrate the efficiency of proposed control scheme. [ABSTRACT FROM AUTHOR]