We establish an efficient minimum-time cooperative task planning algorithm for robots and operators to serve clients. This problem is an extension of the multiple traveling salesman problem and the vehicle routing problem with synchronization constraints, but it is more difficult due to the cooperative tasks of the robots and operators. To find the exact minimum-time task plan with a small tree size, we propose an efficient branch-and-bound with a good initial tree and keen complementary heuristics. Our algorithm is also effective as an approximate algorithm for the many clients problem within the capacity of the computer used. The efficiency of our algorithm is revealed via case studies: telemedical service robots and planetary exploration robots.

A mobile manipulator system (MMS) consists of a robotic arm mounted on a mobile platform that is used in rescue and relief, space exploration, warehouse automation, etc. As the total system has 14 Degrees of Freedom (DOF), it does not have a closed-form inverse kinematics (IK) solution. A learning-based method is proposed, which uses the forward kinematics data to learn the IK relation for motion of an MMS on a rough terrain, using a one-class support vector machine (SVM) framework. Once trained, the model estimates the joint probability distribution of the MMS configuration and end-effector position. This distribution is used to find the MMS configuration for a given desired end-effector path. Past research using a Kohonen Self organizing map (KSOM) neural network-based open-loop control method has shown that the MMS deviates from its desired path while moving on an uneven terrain due to unknown disturbances such as wheel slip, slide, and terrain deformation. Therefore, a new sequential two-stage SVM-based end-effector path-tracking control scheme is proposed to control the end-effector path. In this scheme, the error in the end-effector path is continuously tracked with the help of a Microsoft Kinect 2.0 (Microsoft Regional Sales, Singapore 119968) and is sent as a feedback to the controller. Once the error reaches a threshold value, the error correction step of the controller gets activated to correct the error until the desired accuracy is reached. The effectiveness of the proposed approach is proved through extensive simulations and experiments conducted on 3D terrain in which it is shown that the end effector can follow the desired path with an average experimental error of around 2 cm between the desired and final corrected path.

This paper deals with a continuous design task of a planar cable robot used in a gait training machine called the cable-driven legs trainer. The design of cable robots requires satisfying two constraints, that is, tensions in the cables must remain non-negative, and cable interferences should be avoided. The carried design approach is based on interval analysis, which is one of the most efficient methods to obtain certified results. The constraints of non-negative tensions and cable to end-effector interference are solved using interval analysis tools. By means of a dynamic simulation, the reached workspace and the produced wrenches of the cable robot are evaluated as a set of interval vectors. An optimization algorithm is then designed to optimize the cable robot structure for the gait training machine. The robot is designed to produce non-negative tensions in the cables and to avoid collision at all times within the desired workspace and under the required external loads.

Entities play an essential role in understanding textual documents, regardless of whether the documents are short, such as tweets, or long, such as news articles. In short textual documents, all entities mentioned are usually considered equally important because of the limited amount of information. In long textual documents, however, not all entities are equally important: some are salient and others are not. Traditional entity topic models (ETMs) focus on ways to incorporate entity information into topic models to better explain the generative process of documents. However, entities are usually treated equally, without considering whether they are salient or not. In this work, we propose a novel ETM, Salient Entity Topic Model, to take salient entities into consideration in the document generation process. In particular, we model salient entities as a source of topics used to generate words in documents, in addition to the topic distribution of documents used in traditional topic models. Qualitative and quantitative analysis is performed on the proposed model. Application to entity salience detection demonstrates the effectiveness of our model compared to the state-of-the-art topic model baselines.

In this study, we designed a localization and obstacle avoidance system for humanoid robots in the Federation of International Robot-soccer Association (FIRA) HuroCup united soccer competition event. The localization is implemented by using grid points, gait, and steps to determine the positions of each robot. To increase the localization accuracy and eliminate the accumulated distance errors resulting from step counting, the localization is augmented with image pattern matching using a system model. The system also enables the robot to determine the ball’s position on the field using a color model of the ball. Moreover, to avoid obstacles, the robots calculate the obstacle distance using data extracted from real-time images and determine a suitable direction for movement. With the integration of this accurate self-localization algorithm, ball identification scheme, and obstacle avoidance system, the robot team is capable of accomplishing the necessary tasks for a FIRA soccer game.

The topological structure of a parallel manipulator (PM) determines its intrinsic topological properties (TPs). The TPs further determine essential kinematic and dynamic properties of the mechanism. TPs can be expressed through topological characteristics indexes (TCI). Therefore, defining a set of TCIs is an important issue to evaluate the TPs of PMs. This article addresses the evaluation of topological properties (ETP) of PMs based on TCI. A general and effective ETP method for PMs is proposed. Firstly, 12 TCIs are proposed, including 8 quantitative TCIs, that is, position and orientation characteristics sets (POC), dimension of the POC set, degrees of freedom (DOF), number of independent displacement equations, types and number of an Assur kinematic chain (AKC), coupling degrees of the AKCs, degrees of redundancy and the number of overs; as well as 4 qualitative TCIs, that is, selection of actuated joints, identification of inactive joints, DOF type and Input–Output motion decoupling. Secondly, the ETP method is illustrated by evaluating some well-known PMs including the Delta, Tricept, Exechon, Z3, H4 and the Gough–Stewart platform manipulators, as well as 28 other typical PMs. Via the ETP analysis of these mechanisms also some valuable design knowledge is derived and guidelines for the design of PMs are established. Finally, a 5-DOF decoupled hybrid spraying robot is developed by applying the design knowledge and the design guidelines derived from the ETP analysis.

We investigate the implications of different forms of multigroup connectivity. Four multigroup connectivity modalities are considered: co-memberships, edge bundles, bridges, and liaison hierarchies. We propose generative models to generate these four modalities. Our models are variants of planted partition or stochastic block models conditioned under certain topological constraints. We report findings of a comparative analysis in which we evaluate these structures, controlling for their edge densities and sizes, on mean rates of information propagation, convergence times to consensus, and steady-state deviations from the consensus value in the presence of noise as network size increases.

Session types are a rich type discipline, based on linear types, that lifts the sort of safety claims that come with type systems to communications. However, web-based applications and microservices are often written in a mix of languages, with type disciplines in a spectrum between static and dynamic typing. Gradual session types address this mixed setting by providing a framework which grants seamless transition between statically typed handling of sessions and any required degree of dynamic typing. We propose Gradual GV as a gradually typed extension of the functional session type system GV. Following a standard framework of gradual typing, Gradual GV consists of an external language, which relaxes the type system of GV using dynamic types; an internal language with casts, for which operational semantics is given; and a cast-insertion translation from the former to the latter. We demonstrate type and communication safety as well as blame safety, thus extending previous results to functional languages with session-based communication. The interplay of linearity and dynamic types requires a novel approach to specifying the dynamics of the language.

The flexible motion of the inchworm makes the locomotion mechanism as the prominent one than other limbless animals. Recently, the application of engineering greatly assists the inchworm locomotion to be applicable in the robotic mechanism. Due to the outstanding robustness, sliding mode control (SMC) has been validated as a robust control strategy for diverse types of systems. Even though the SMC techniques have made numerous achievements in several fields, some systems cannot be comfortably accepted as the general SMC approaches. Accordingly, this paper develops the Grey Wolf-Second order sliding mode control (GW-SoSMC) to control the manipulator of the inchworm robot. The GW-SoSMC reduces the chattering phenomenon of SMC and improves the controlling ability of SoSMC by weightage function. Subsequently, it compares the performance of the proposed method with several conventional techniques like Grey Wolf-SMC (GW-SMC), FireFly-SoSMC (FF-SoSMC), Artificial Bee Colony-SoSMC (ABC-SoSMC), Group Searching-SoSMC (GS-SoSMC), and Genetic Algorithm-SoSMC (GA-SoSMC). It portrays the valuable comparative analysis by measuring the accomplished joint angles, error, and response of the controller. Thus the proposed method discovers the supervisory controller for the inchworm robot that is immensely better than conventional controllers mentioned earlier.

In this paper, the behavioral learning of robots through spiking neural networks is studied in which the architecture of the network is based on the thalamo-cortico-thalamic circuitry of the mammalian brain. According to a variety of neurons, the Izhikevich model of single neuron is used for the representation of neuronal behaviors. One thousand and ninety spiking neurons are considered in the network. The spiking model of the proposed architecture is derived and prepared for the learning problem of robots. The reinforcement learning algorithm is based on spike-timing-dependent plasticity and dopamine release as a reward. It results in strengthening the synaptic weights of the neurons that are involved in the robot’s proper performance. Sensory and motor neurons are placed in the thalamus and cortical module, respectively. The inputs of thalamo-cortico-thalamic circuitry are the signals related to distance of the target from robot, and the outputs are the velocities of actuators. The target attraction task is used as an example to validate the proposed method in which dopamine is released when the robot catches the target. Some simulation studies, as well as experimental implementation, are done on a mobile robot named Tabrizbot. Experimental studies illustrate that after successful learning, the meantime of catching target is decreased by about 36%. These prove that through the proposed method, thalamo-cortical structure could be trained successfully to learn to perform various robotic tasks.

Natural Formalization proposes a concrete way of expanding proof theory from the meta-mathematical investigation of formal theories to an examination of “the concept of the specifically mathematical proof.” Formal proofs play a role for this examination in as much as they reflect the essential structure and systematic construction of mathematical proofs. We emphasize three crucial features of our formal inference mechanism: (1) the underlying logical calculus is built for reasoning with gaps and for providing strategic directions, (2) the mathematical frame is a definitional extension of Zermelo–Fraenkel set theory and has a hierarchically organized structure of concepts and operations, and (3) the construction of formal proofs is deeply connected to the frame through rules for definitions and lemmas.

To bring these general ideas to life, we examine, as a case study, proofs of the Cantor–Bernstein Theorem that do not appeal to the principle of choice. A thorough analysis of the multitude of “different” informal proofs seems to reduce them to exactly one. The natural formalization confirms that there is one proof, but that it comes in two variants due to Dedekind and Zermelo, respectively. In this way it enhances the conceptual understanding of the represented informal proofs. The formal, computational work is carried out with the proof search system AProS that serves as a proof assistant and implements the above inference mechanism; it can be fully inspected at http://www.phil.cmu.edu/legacy/Proof_Site/.

We must—that is my conviction—take the concept of the specifically mathematical proof as an object of investigation.

Hilbert 1918

User validation is one of the challenges facing the ontology alignment community, as there are limits to the quality of the alignments produced by automated alignment algorithms. In this paper, we present a broad study on user validation of ontology alignments that encompasses three distinct but inter-related aspects: the profile of the user, the services of the alignment system, and its user interface. We discuss key issues pertaining to the alignment validation process under each of these aspects and provide an overview of how current systems address them. Finally, we use experiments from the Interactive Matching track of the Ontology Alignment Evaluation Initiative 2015–2018 to assess the impact of errors in alignment validation, and how systems cope with them as function of their services.

Navigation and path analysis in a cluttered environment is a challenging task over the last few decades. In this paper, a behavior-based neural network (BNN) and reactive control architecture have been presented for navigation of the mobile robot. Two different reactive behaviors have been taken as inputs function. Obstacle position is the first reactive behavior given by u(o), whereas obstacle angle u(n) according to the target position is the second reactive behavior. The angular velocity and steering angle are the output of the controller. The backpropagation architecture reduces the errors of weight function and records the best weight data that match the BNN controller. Using the BNN algorithm, the robot reacts quickly as compared to other developed techniques. To validate the performance of the controller, simulation and experimental results have been compared in the common platforms. The deviation in results for both the scenarios is found to be within 10%. The results of the BNN algorithm have also been compared with other existing techniques. Effectiveness of the proposed technique is measured in terms of smoothness of the realistic path, collision point detection, path length, and performance time.

Stability is a major problem with bilateral teleoperator when there is a transmission time delay. By adding adequate damping gain into position servo, a stable bilateral control can be achieved under the existence of time delay. However, large damping gain is required to stabilize the system and the performance is degraded. In this paper, the performance improvement by introducing a high-pass filter into a proportional derivative-based teleoperator with time delay has been studied. We proposed new control law and derived the stability condition. We demonstrated the performance improvement using a hybrid matrix, 1-degree of freedom (DOF), 2-DOF simulations, and 2-DOF peg-in-hole experiments.

In this paper, a new mobile cable-driven parallel robot is proposed by mounting a spatial cable robot on a wheeled mobile robot. This system includes all the advantages of cable robots such as high ratio of payload to weight and good stiffness and accuracy while its deficiency of limited workspace is eliminated by the aid of its mobile chassis. The combined system covers a vast workspace area whereas it has negligible vibrations and cable sag due to using shorter cables. The dynamic equations are derived using Gibbs–Appell formulation considering viscoelasticity of the cables. Therefore, the more realistic viscoelastic cable model of the robot reveals the system flexibility effect and shows the requirements needed to control the end-effector in the conditions with cable elasticity. The viscoelastic system stability is investigated based on the input–output feedback linearization and using only the actuators feedback data. Feedback linearization controller is equipped by two additional controllers, that is, the optimal controller based on Linear Quadratic Regulator (LQR) method and finite horizon model predictive approach. They are used to control the system compromising between the control effort and error signals of the feedback linearized system. The applied control input to the robot plant is the voltage signal limited to a specified band. The validity of modeling and the designed controller efficiency are investigated using MATLAB simulation and its verification is accomplished by experimental tests conducted on the manufactured cable robot, ICaSbot.

The inducibility of a graph H measures the maximum number of induced copies of H a large graph G can have. Generalizing this notion, we study how many induced subgraphs of fixed order k and size ℓ a large graph G on n vertices can have. Clearly, this number is $\left( {\matrix{n \cr k}}\right)$ for every n, k and $\ell \in \left\{ {0,\left( {\matrix{k \cr 2}} \right)}\right\}$. We conjecture that for every n, k and $0 \lt \ell \lt \left( {\matrix{k \cr 2}}\right)$ this number is at most $ (1/e + {o_k}(1)) {\left( {\matrix{n \cr k}} \right)}$. If true, this would be tight for ℓ ∈ {1, k − 1}.

In support of our ‘Edge-statistics Conjecture’, we prove that the corresponding density is bounded away from 1 by an absolute constant. Furthermore, for various ranges of the values of ℓ we establish stronger bounds. In particular, we prove that for ‘almost all’ pairs (k, ℓ) only a polynomially small fraction of the k-subsets of V(G) have exactly ℓ edges, and prove an upper bound of $ (1/2 + {o_k}(1)){\left( {\matrix{n \cr k}}\right)}$ for ℓ = 1.

Our proof methods involve probabilistic tools, such as anti-concentration results relying on fourth moment estimates and Brun’s sieve, as well as graph-theoretic and combinatorial arguments such as Zykov’s symmetrization, Sperner’s theorem and various counting techniques.

The consensus of higher-order nonlinear heterogeneous multiagent systems with matched and unmatched uncertainties is studied in this paper. The distributed observer-based controllers for multiagent systems are achieved using a fixed-time sliding mode controller based on the disturbance observer. For this purpose, the disturbance observers are designed for finite-time estimation of matched and unmatched uncertainties. Using the estimated values, the fixed-time distributed sliding mode controllers are designed and the consensus protocol is achieved. In this regard, a theorem is proved, which guarantees the fixed-time convergence of consensus errors. The effectiveness of the proposed distributed controllers has been validated through simulations for two robotic multiagent systems and a numerical example.