http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Xie Meng,Du Jinying,Yang Kunqi,Song Shaoting,Lv Zonghui,Xu Huailiang,Wen An Xiang,Wang Qin,Jiang Yanzhi,Zhu Guangxiang,Wu Jiayun,Yao Yongfang,Ni Qingyong 한국곤충학회 2021 Entomological Research Vol.51 No.2
Leaf-rolling weevils (Coleoptera: Atelabidae) are considered to be specialists that oviposit only on one or two plant species. However, Apoderus dimidiatus can oviposit on at least five species. We aimed to determine whether A. dimidiatus females have different preferences for oviposition substrates, and whether differences in physical factors, nutrition and parasitism affected their choices. We observed the number of cradles, hatched larvae, pupae, emerging adults and parasitism rate during one breeding season. Weevils were given access to two host plant species, Rosa multiflora and Rubus ichangensis, and the leaf size and nutrient contents of the two plant species were investigated. We found that nutritional content, especially soluble carbohydrate, correlated with oviposition preference of weevils, and the more nutritious plant species, R. multiflora, was the preferred host in our experiment. Weevils can also use Ru. ichangensis and other plant species as hosts, likely to relieve the high parasitic pressure when laying eggs on a single host species.
Hedonic Coalition Formation for Distributed Task Allocation in Heterogeneous Multi-agent System
Lexing Wang,Tenghai Qiu,Zhiqiang Pu,Jianqiang Yi,Jinying Zhu,Wanmai Yuan 제어·로봇·시스템학회 2024 International Journal of Control, Automation, and Vol.22 No.4
Due to the complexity of tasks in the real world, multiple agents with different capabilities tend to cooperate to handle diverse requirements of these tasks by forming coalitions. To solve the problem of finding optimal heterogeneous coalition compositions, this paper proposes a novel distributed hedonic coalition formation game method to solve the task allocation problem for multiple heterogeneous agents. Firstly, to quantify the intention of an agent joining each coalition, a utility function for each agent is designed based on the cost and the reward with regard to the given tasks, where the heterogeneous requirements of tasks are also considered. Then, a preference relation related to the utility function is designed for the self-interested agents autonomously choose to join or leave a coalition. Subsequently, a theorem is presented, and analyses have been conducted to show that the proposed method achieves a Nash-stable solution in the heterogeneous system. Further, to develop a Nash stable partition result, a distributed hedonic coalition formation algorithm containing prioritization and consensus stages is designed for each agent to make decisions. The algorithm is implemented based on local interactions with neighbor agents under a connected communication network. Finally, simulations are conducted to verify the performance of the proposed method. Results show that the proposed method has the feasibility in solving heterogeneous composition and the broader scalability in different scenarios.