BACKGROUND Turning-while-walking is one of the commonest causes of falls in stroke survivors. It involves cognitive processing and may be challenging when performed concurrently with a cognitive task. Previous studies of dual-tasking involving turning-while-walking in stroke survivors show that the performance of physical tasks is compromised. However, the design of those studies did not addres...

The purpose of this study was to examine collaborative problem solving in a shared virtual space. The main question asked was: How will the performance and processes differ between collaborative problem solvers and independent problem solvers over time? A total of 104 university students (63 female and 41 male) participated in an experimental study. Participants were randomly assigned to four d...

Recently, more and more researches have been conducted on the multi-robot system by applying bioinspired algorithms. Particle Swarm Optimization (PSO) is one of the optimization algorithms that model a set of solutions as a swarm of particles that spread in the search space. This algorithm has solved many optimization problems, but has a defect when it is applied on search tasking. As the time ...

The Ada language has been designed to support development of concurrent and distributed sojiware. While the Ada-83 standard defined the basic mechanisms of rendezvous-based tasking, the Ada-95 standard significantly extended this capability with the introduction of several advanced tasking constructs. We present and discuss formal models of these key tasking constructs using the Petri net model...

The Ada language has been designed to support development of concurrent and distributed software. While the Ada-83 standard de®ned the basic mechanisms of rendezvous-based tasking, the Ada-95 standard signi®cantly extended this capability with the introduction of several advanced tasking constructs. We present and discuss formal models of these key tasking constructs using the Petri net model. ...

Abstract Real-world optimization applications in complex systems always contain multiple factors to be optimized, which can formulated as multi-objective problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables objectives increase, computation costs those mentioned will unaffordable. To reduce such...

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard problem. Previous studies focus on approximation algorithms which search for optimal solution in relatively large space. Thus, these consume a amount of computational resources while the quality obtained results lower than expected. order to enhance performance process, this paper proposes two different approaches are in...

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differen...

Research on distributed task planning model for multi-autonomous underwater vehicle (MAUV). A scroll time domain quantum artificial bee colony (STDQABC) optimization algorithm is proposed to solve the multi-AUV optimal task planning scheme. In the uncertain marine environment, the rolling time domain control technique is used to realize a numerical optimization in a narrowed time range. Rolling...