In order to solve the problem of path planning for spacecraft cluster reach dynamic target point under premise considering obstacle avoidance. view fixed search radius, it will be difficult find a better value when is close point. This paper converts orbital dynamics each member into an optimization constraints, and proposes improved CPSO algorithm based on coordination. The method traditional ...

Cluster randomized trials have become the design of choice for evaluating the effect of selected interventions on well-known health indicators such as neonatal mortality rate, episiotomy rate, and postpartum hemorrhage rate in a community setting. Determining the sample size of a cluster randomized trial requires a reliable estimate of cluster size and the intracluster correlation (ICC), becaus...

In this paper we address a reconfiguration planning method for locomotion of a homogeneous modular robotic system and we conduct an experiment to verify that the planned locomotion can be realized by hardware. Our recently developed module is self-reconfigurable. A group of the modules can thus generate various three-dimensional robotic structures and motions. Although the module itself is a si...

New applications that use AI planning to generate explanations and hypotheses have given rise to a new class of planning problems, requiring finding multiple alternative plans while minimizing the cost of those plans. Hypotheses or explanations about a system, such as a monitored network host that could be infected by malware, are generated as candidate plans given a planning problem definition...

With the high rate of ecosystem change already occurring and predicted to occur in the coming decades, long-term conservation has to account not only for current biodiversity but also for the biodiversity patterns anticipated for the future. The trade-offs between prioritising future biodiversity at the expense of current priorities must be understood to guide current conservation planning, but...