The proceedings contain 24 papers. The topics discussed include: autonomous floating garbage collection device using computer vision and robotics;coordinated optimization of scheduling and path planning for delivery r...
ISBN:
(纸本)9798400718304
The proceedings contain 24 papers. The topics discussed include: autonomous floating garbage collection device using computer vision and robotics;coordinated optimization of scheduling and path planning for delivery robots in intelligent manufacturing workshops;a preliminary study of the stressed and drowsy driving prediction models using semi-supervised learning;axial capacity prediction of concrete externally strengthened by low-cost natural fiber reinforced polymer composite utilizing machine learning intelligence;enhancing brain tumor diagnosis: a cutting-edge ensemble deep learning approach;a comparative study of sentiment analysis on twitter and reddit using deep learning techniques;generative artificial intelligence for future education: current research status, hot spots, and research trends;methodological considerations for anonymizing tabular data using generative adversarial networks;and data migration in large scale storage systems with varying file sizes.
We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside...
ISBN:
(纸本)9781956792041
We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside our control, such as weather conditions. The placement should be robust to this uncertainty, to gain a competent total reward across possible networks. To study such scenarios, we introduce the Robust Reward Placement problem (RRP). Agents move randomly by a Markovian Mobility Model with a predetermined set of locations whose connectivity is chosen adversarially from a known set. of candidates. We aim to select a set of reward states within a budget that maximizes the minimum ratio, among all candidates in., of the collected total reward over the optimal collectable reward under the same candidate. We prove that RRP is NP-hard and inapproximable, and develop Psi-Saturate, a pseudo-polynomial time algorithm that achieves an is an element of-additive approximation by exceeding the budget constraint by a factor that scales as O(ln |Iota Iota|/is an element of). In addition, we present several heuristics, most prominently one inspired by a dynamic programming algorithm for the maxmin 0-1 KNAPSACK problem. We corroborate our theoretical analysis with an experimental evaluation on synthetic and real data.
This article provides a comprehensive overview of improved inventory management models in technology companies and how AI methodologies such as machine learning, predictive analytics, and optimization algorithms are r...
详细信息
On the basis of improving the basic model through experiments in the early stage and obtaining a modified GOMS model, in order to verify its effectiveness, this article adopts an experimental method based on typical h...
详细信息
The traditional fertilizer application method relies on experience to apply fertilizer on a large scale, which has problems such as fertilizer waste and environmental pollution, and affects the sustainable development...
详细信息
The Israel-Palestine conflict that occurred on October 7, 2023, resulted in a boycott of brands known to be pro-Israel. Twitter or X, as one of the largest social media platforms in the world, became a platform for pe...
详细信息
Calculating the dexterity value of a certain point is the foundation for demonstrating the dexterity of the robot. Furthermore, the criteria for calculating the dexterity value of the given point determines the authen...
详细信息
ISBN:
(纸本)9789819607945;9789819607952
Calculating the dexterity value of a certain point is the foundation for demonstrating the dexterity of the robot. Furthermore, the criteria for calculating the dexterity value of the given point determines the authenticity of the capability map. Traditional methods that use Jacobian matrix to find inverse kinematic to determine whether a pose is reachable exhibit uncertainty around singularities. Thus, this article proposes an approach for calculating the dexterity of points based on a serial-parallel hybrid 7-degree-of-freedom robot. By improving the inverse kinematics solving process and selecting the optimal solutions, this method addresses the issues of low efficiency and inaccuracy in calculations near singular points. Additionally, this method does not require consideration of the configuration of the robot's end-effector axis, thus offering broader applicability. By analyzing the characteristics of the capability map and explaining the reasons behind their formation, verify the practicality and potential applications of this criteria.
The prediction of customer attrition in the banking industry has gained significant attention due to the proliferation of services and the need to retain customers in today's competitive market, particularly when ...
详细信息
The omnipresence of wireless communication highlights the importance of efficient radio spectrum management. Traditional monitoring, based on spectral analysis, is challenged by diverse and fluctuating signal environm...
详细信息
With the rapid development of industrial automation and intelligence, fault detection technology has become key to ensuring system stability and safety. Neural networks, as outstanding data processing and pattern reco...
详细信息
暂无评论