Search Results (287)

This study addresses dynamic multi-UAV task allocation under online task release, static obstacles, deadlines, limited energy, and vehicle failures. We propose an event-triggered path-based bid assignment method (ET-PBBA). At each mission event, an A-star module estimates the static-obstacle travel cost of feasible UAV–task pairs, while a normalized score combines reward, path length, predicted energy, and secondary load–energy pressure. A one-pass sorted scan then produces an event-local one-to-one assignment. Paired-seed mechanism tests show that event-time activation raises completion rate by 0.046 in the main scenario and 0.065 under failure stress relative to 10 s periodic allocation. The path-dependent physical-cost block provides the dominant improvement over reward-only ranking, whereas the balance term is not significant in the ordinary scenarios. For 10 UAVs and 50 tasks, ET-PBBA reduces average completion time by 5.2% and 4.1% and total energy by 4.3% and 3.0% relative to auction and CBBA, respectively, although Hungarian remains the stronger centralized reference. Under failure stress, completion reaches 0.790 and deadline violations decrease to 9.73. Single-UAV replay completes all 50 nominal waypoints with 9.16 cm mean error, providing auxiliary tracking evidence rather than validation of nonlinear or online multi-UAV execution. Full article

In engineering R&D organizations, resource contention among autonomous projects creates complex scheduling challenges in distributed multi-project environments. Traditional coordination mechanisms often prioritize global efficiency while overlooking inter-project fairness, which can lead to stakeholder resistance and execution delays. This study proposes a transparent decision support approach for the Distributed Resource-Constrained Multi-Project Scheduling Problem (DRCMPSP). We develop a two-stage scheduling mechanism that integrates Multi-Criteria Decision-Making (MCDM) into the global coordination process. First, an enhanced Chaotic Genetic Algorithm (CGA) with elitism generates local schedules. Second, global resource conflicts are resolved using MCDM methods. Inter-project fairness is implemented by limiting each project’s relative objective deterioration and by evaluating the dispersion of the resulting project-level burdens. Validation through an Unmanned Aerial Vehicle R&D case study and extensive experiments shows that the TOPSIS-based mechanism achieves a significantly lower standard deviation than the auction-based mechanism under high resource contention. The approach supports transparent and fairness-aware conflict resolution by making trade-offs among project-level outcomes explicit to managers. Full article

The growing adoption of renewable energy and small-scale power producers has increased the need for reliable and transparent peer-to-peer (P2P) energy trading. Traditional centralized markets often struggle with high transaction fees, limited transparency, and a greater risk of manipulation, which restrict efficient energy distribution. To overcome these issues, this study presents a decentralized P2P trading framework that implements a fully functional blockchain-based trading system with smart grid simulation and demonstrates a prototype machine learning forecasting module (Random Forest, 84% accuracy) designed for future integration. The trading mechanism is developed using Ethereum smart contracts and a custom ERC-20 token, the TUM Energy Coin (TEC), enabling secure and traceable energy exchange. System security is strengthened through dual confirmation steps, role-based access control, and consensus-driven market clearing. A double-sided auction model is used to match buyers and sellers fairly. Real-time grid behavior such as fluctuating loads, prosumer generation, and consumer demand is modeled using MATLAB Simulink to reflect realistic operating conditions. To enhance decision-making, a Random Forest model is integrated for load forecasting and dynamic pricing, achieving an accuracy of 84%. The simulation results show improved transaction throughput, more stable pricing, and strong resilience against false-data injection attacks. The primary novelty of this work lies in (1) an entirely operational and validated blockchain-trading system simulation with synchronized time using Simulink, (2) a working Random Forest forecasting tool demonstrating feasibility for incorporation in the future, and (3) an analysis of the system’s robustness in the case of FDIA attacks. The authors point out that the ML component used is a prototype and not yet integrated into the functioning block chain. Full article

Telemedicine in emergency and remote care relays medical images from ambulances and rural clinics to a hospital edge-computing server over a congested wireless uplink. Existing work prices such transmissions per bit or per quality-of-experience; neither metric captures the clinical value of a medical transmission. Diagnostic utility vanishes below a modality-specific acceptability floor rather than degrading gracefully, the deadline is determined by triage acuity rather than by the network, and a missed finding is far costlier than a false alarm. A per-bit clearing price therefore disadvantages the node that has expended local compute to produce a compact, diagnostically sufficient stream. We propose SemAuc, a triage-aware truthful mechanism for medical-image admission over a rate-splitting uplink, in which the shared semantic knowledge base rides the common stream, and case-specific residuals ride private streams. SemAuc filters tiers below the diagnostic floor and beyond the clinical deadline, reserves a regulated-price lane for life-threatening cases, and allocates remaining capacity through a single-parameter contestable auction whose bid-independent pre-selection step satisfies the conditions of Myerson’s lemma. The contestable lane is dominant-strategy truthful, individually rational, near-linear in the number of nodes, and achieves a constant-factor density-greedy welfare guarantee; the clinical lanes follow from triage policy without disturbing these properties. Diagnostic value is grounded by an offline kernel fitted on BraTS and CheXpert. On a Rayleigh-faded uplink at two hundred contending nodes, SemAuc preserves the high-acuity diagnostic service-level objective where bit-centric benchmarks fail, and tracks the offline optimum. Full article

Energy-efficient coordination of robotic swarms requires effective integration of task scheduling, motion planning, and communication management, particularly in resource-constrained environments where computation and wireless communication compete for limited energy resources. Existing multi-robot approaches typically address these concerns in separate stages: task-allocation methods (e.g., market- and auction-based schemes) price assignments by distance, and computation-offloading methods decide execution placement after a route has been fixed. This paper’s specific contribution is to fold the execution-placement decision (local computation versus offloading to a peer) into the edge-relaxation step of an A* path search, using a composite cost whose communication term is derived from the instantaneous neighborhood of each node; routing and compute placement are therefore co-optimized within a single search rather than in decoupled stages. The framework is evaluated in simulation with a swarm of 25 robots against two decoupled baselines: a path-only planner that ignores workload and communication costs, and a workload-only scheduler that ignores travel and communication costs. Across 20 randomized trials, the proposed heuristic reduces total swarm energy consumption by approximately 22% relative to the path-only baseline and 9% relative to the workload-only baseline, shortens average task completion time by roughly 20%, and lowers the load imbalance factor from 6.7 (path-only) and 3.2 (workload-only) to 1.9. We report these gains for the tested configurations and delimit their scope: the search retains the asymptotic complexity of standard A*, but path optimality does not extend to the compute-placement decisions, which are locally greedy, and all results are obtained in simulation rather than on hardware. Full article

The rapid growth of electric vehicle (EV) adoption presents significant challenges for power system stability while creating new opportunities for decentralized energy management. Peer-to-peer (P2P) energy networks have emerged as a promising approach for transforming EVs from passive loads into coordinated grid assets. This paper presents a comprehensive review of EV-P2P integration through a three-layer architectural framework that systematically connects physical infrastructure, market mechanisms, and intelligent control strategies. The Physical Layer reviews how V2X technologies and bidirectional charging enable EVs to operate as flexible storage resources and ancillary service providers. The Transactional Layer reviews on blockchain-based platforms, auction mechanisms, and game-theoretic models for secure energy trading. The Intelligence Layer reviews advanced control strategies, including decentralized optimization methods such as the Alternating Direction Method of Multipliers (ADMM) and Deep Reinforcement Learning. Collectively, the reviewed studies demonstrate that these approaches enable EVs to operate as flexible loads, distributed storage resources, and ancillary service providers, while improving energy trading efficiency, reducing operating costs, and alleviating network congestion under simulated operating conditions. Despite these promising results, a substantial gap remains between simulation-based studies and practical implementation. Future research should prioritize integrated pilot projects to evaluate scalability, interoperability, cybersecurity, and regulatory compliance under realistic operating conditions. Full article

Conversion Rate Optimisation (CRO) has emerged as a central strategic priority in e-commerce management, yet its positioning within the broader interactive marketing paradigm remains theoretically underdeveloped. Interactive marketing, defined as a multi-directional value creation process through active customer connection, engagement, participation, and interaction, provides a critical lens through which the effectiveness and efficiency of digital marketing tactics can be understood, as each tactic mediates a distinct form of consumer brand interactivity. The academic literature, however, remains fragmented; no unified comparative framework exists that simultaneously assesses both effectiveness and efficiency of digital marketing tactics within an interactive marketing context. Drawing on the classical effectiveness and efficiency framework and interactive marketing theory, this study addresses this gap through a cross-sectional quantitative survey of 302 digital marketing professionals, evaluating a broad range of tactics across both dimensions using a validated psychometric instrument. The findings reveal that Email Marketing consistently dominates across effectiveness and efficiency assessments, reflecting its permission-based structure and its capacity to sustain ongoing consumer–brand dialogue. Search Engine Marketing exhibits the most pronounced divergence between effectiveness and efficiency, consistent with auction-driven cost dynamics that constrain interactive value creation. Attribution modelling difficulty emerges as the primary structural barrier to CRO implementation, revealing a systemic challenge to evidence-based resource allocation in multi-channel interactive environments. An exploratory factor analysis identifies a three-factor taxonomy of tactic effectiveness, distinguishing Paid Conversion tactics, data-driven optimisation tools, and organic or relationship-based channels, each representing a qualitatively distinct mode of consumer–brand interaction. This study advances interactive marketing theory by providing the first empirically validated effectiveness–efficiency framework for e-commerce CRO, and offers actionable guidance for cross-channel budget allocation decisions in interactive digital environments. Full article

Active area protection against unauthorized UAV swarms requires coordinated target assignment strategies that account for both low-level physical capabilities and the stochastic, consumptive nature of physical interceptions. This paper presents a decentralized target assignment framework based on probabilistic flow optimization. By utilizing an aerodynamics-aware flight model, we derive a probabilistic prior to capture the geometric dependency of terminal interception success under high-velocity maneuvers. Modeling the defense process as a probabilistic consumption flow couples initial tactical assignments with conditional transition flows, allowing surviving defensive assets to be proactively redistributed to secondary unauthorized intrusions. To resolve this problem under practical communication and sensing constraints, we develop the Distributed Flow-regularized Market-based Consensus (DFMC) algorithm. The proposed algorithm decomposes the global optimization into localized subproblems and employs a water-filling projection to plan secondary paths. Simulation results demonstrate that the proposed framework yields improved interception rates and better spatial resource dispersion compared to conventional auction-based baselines, while maintaining stable scalability in dense interception scenarios. Full article

Autonomous AI agents capable of holding digital assets, signing transactions, and executing smart contracts on public blockchain networks have moved from research prototypes to active deployment over the past two years. Despite this pace of adoption, no systematic treatment of their architecture, coordination protocols, and governance structures exists that spans the full design space. This survey addresses that gap through a systematic review of the literature from 2019 to 2026, covering 177 peer-reviewed publications and 14 system documentation sources, identified through a structured search of IEEE Xplore, the ACM Digital Library, Scopus, and arXiv. We classify deployed and proposed systems along four architectural dimensions: on-chain execution, off-chain agents with on-chain settlement, verifiable off-chain computation, and multi-agent on-chain interaction. Then, we examine the coordination mechanisms through which agents reach collective decisions, covering auction-based protocols, cooperative multi-agent reinforcement learning, token-incentive structures, and gossip-based peer-to-peer coordination. Governance is treated as a distinct dimension, analysed through a technical lens, covering on-chain parameter control, dispute resolution, and DAO structures, and an organizational one, covering accountability, incentive alignment, principal–agent dynamics, and regulatory compatibility. We survey applications across decentralized finance, supply chain, IoT, and agent marketplace domains, and identify six open research problems whose resolution is a prerequisite for broader deployment. The convergence of mechanism design and multi-agent reinforcement learning in asynchronous blockchain environments is identified as the direction of greatest near-term research value. Full article

Quantum Secure Multi-party Summation (QSMS) is a fundamental primitive of Quantum Secure Multi-party Computation (QSMC), enabling multiple participants to jointly compute the sum of their private inputs without disclosing individual data. However, most existing QSMS protocols require all participants to possess full quantum capabilities and often rely on pre-shared keys, auxiliary mask transmission, or multiple trusted third parties, resulting in high communication overhead and limited practicality. To address these limitations, we propose an efficient Semi-Quantum Secure Multi-party Summation (SQSMS) protocol based on d-dimensional n-particle entangled states. By exploiting the global correlation properties of high-dimensional entangled states, the proposed protocol generates correlated random masks directly from quantum measurement outcomes. These masks cancel automatically during the aggregation process, eliminating the need for additional mask distribution and transmission. Compared with existing QSMS schemes, the proposed protocol reduces communication overhead, improves quantum efficiency, and avoids reliance on pre-shared keys or multiple trusted third parties. Moreover, only simple measurement operations are required from classical participants, making the protocol more practical for semi-quantum environments. We further provide formal correctness and security analyses of the proposed protocol and conduct quantum circuit simulations using the IBM Qiskit platform to demonstrate its feasibility. Moreover, based on the proposed summation protocol, we design several extended application protocols, including anonymous voting, anonymous auction, and anonymous ranking, which further illustrate the scalability and practical applicability of the proposed scheme. Full article

Coordinating robot swarms requires jointly solving the interdependent Multi-Robot Task Allocation (MRTA) and Multi-Agent Path Finding (MAPF) problems under strict time and communication constraints, yet most existing methods rely on centralized planning or expose agents’ exact positions. In this study, a fully decentralized algorithm is proposed in which each agent estimates the positions and intended plans of others from broadcast bid values rather than shared coordinates, anticipating conflicts at intersections before moving and dynamically altering its movement or task assignment when it predicts it cannot reach its task in time. The method combines the Priority Inheritance with Backtracking (PIBT) algorithm for collision-free navigation with a novel Interval Type-3 Fuzzy Logic (IT3FL) mechanism for conflict resolution and congestion-aware rerouting. The approach was evaluated across seven benchmark environments against the centralized methods Enhanced Conflict-Based Search (ECBS) and ECBS with Task Allocation (ECBS-TA) and the Consensus-Based Auction Algorithm (CBAA). It reduced path cost by up to 7.10% relative to ECBS in open environments, while centralized methods remained superior in complex corridor-based maps. In the most demanding constrained scenario, it reduced solution cost by up to 47.03% and improved task completion by 35% over CBAA, demonstrating a robust, scalable decentralized alternative. Full article

Marine fisheries provide a nutrient source for humans, and Indonesian marine fisheries have the second-highest production rate globally. Reliable evidence of the volume of captured fish is crucial for the sustainable management of Indonesian fisheries. The Labuan Fishing Port in Banten Province, Sunda Strait, was surveyed between September 2022 and March 2023. Based on personal inspections and an anonymous questionnaire, fishermen used various methods to catch fish. The captures by fisheries showed that the gear types, including purse seines and a mix of several types of gear, were the largest contributors to officially registered (auctioned) production, with 85.85% and 83.91% of their captures being auctioned, while bottom otter trawls auctioned 7.91% of their capture only. The reported reasons for unrecorded catch varied, with time pressure and lack of supervision being the leading factors. Most unrecorded captured fish were sold directly to buyers or taken home for consumption. Thus, the reports are considered inaccurate. Implementation of real-time data capture techniques and enhancements to marketing and auction systems was recommended. Full article

The cooperative airdrop of UAV swarms by multiple transport aircraft creates a large-scale multi-agent planning problem. The mission involves heterogeneous aircraft, multi-visit airdrop areas, strict time windows, and threat-aware flight paths. To address these challenges, this work develops an integrated framework for both global task allocation and real-time replanning in complex three-dimensional operational environments. First, for the combinatorial optimization of task execution sequences across multiple aircraft, a static task assignment method is proposed. This method employs a Hybrid-encoding Constrained Black-winged Kite Algorithm (HCBKA), which incorporates optimization metrics such as mission execution time, completion rate, and load-balancing symmetry among aircraft. The HCBKA aims to find a task assignment scheme that achieves a comprehensive optimum across multiple objectives through efficient model solving. Second, to handle potential real-time dynamic changes during mission execution, a rapid-response and generalizable replanning mechanism is developed. This mechanism utilizes an event-triggered strategy based on a Time-window aware Dynamic Auction Algorithm (TDAA). It ensures that the system can promptly initiate and execute online task reallocation in response to contingencies such as changing mission requirements or losses within its own drone swarm, thus maintaining the adaptability and robustness of the overall plan. Simulation results show that the proposed framework produces high-quality global solutions and maintains strong robustness under dynamic changes. The approach provides an effective and scalable solution for coordinated multi-aircraft swarm airdrop missions. Full article

Dynamic task allocation for UAV swarms in complex scenarios is often complicated by uncertain object discovery, potential UAV loss, as well as stringent battery and execution resource limitations. These resource constraints critically affect UAV survivability and mission success but are frequently neglected in existing studies. This paper develops an auction-based dynamic task allocation for resource-constrained UAV swarms conducting cooperative monitoring and interception missions in dynamic scenarios. Task priority is incorporated to prioritize high-urgency areas and identified objects, and a threshold-based cooperative engagement strategy is proposed to facilitate multi-UAV coordination for interception missions beyond individual UAV capabilities. Meanwhile, battery-aware resource allocation is adopted to improve utilization during cooperative operations. Simulation results across scenario scales and resource configurations demonstrate that the proposed method significantly improves UAV survivability while maintaining competitive mission completion rates, proving its effectiveness for resource-constrained UAV swarm operations. Full article

This paper investigates the problem of contract coordination in a two-tier multi-unit auction supply chain consisting of a seller and an auction house. We theoretically show that the conventional commission-based mechanism distorts the transmission of demand information from the demand side to the supply side, thereby preventing effective supply chain coordination. In contrast, guaranteed auction contracts can achieve coordination under both cooperative and non-cooperative game frameworks. Under the cooperative game setting, profits are allocated according to a Nash bargaining solution, in which each party receives its disagreement payoff and a bargaining-power-weighted share of the surplus, with risks and returns being allocated symmetrically. Under the non-cooperative game setting, the supply chain leader can appropriate a larger share of the total profit while bearing relatively lower risk. These results indicate that, as the supply chain leader, the auction house can select different cooperation modes under guaranteed auction contracts according to its bargaining position, but profit allocation should be benchmarked against the cooperative game outcome in order to enhance the long-term competitiveness and stability of the supply chain. Full article