Goto

Collaborating Authors

 Energy


Bayesian-Driven Graph Reasoning for Active Radio Map Construction

arXiv.org Artificial Intelligence

With the emergence of the low-altitude economy, radio maps have become essential for ensuring reliable wireless connectivity to aerial platforms. Autonomous aerial agents are commonly deployed for data collection using waypoint-based navigation; however, their limited battery capacity significantly constrains coverage and efficiency. To address this, we propose an uncertainty-aware radio map (URAM) reconstruction framework that explicitly leverages graph-based reasoning tailored for waypoint navigation. Our approach integrates two key deep learning components: (1) a Bayesian neural network that estimates spatial uncertainty in real time, and (2) an attention-based reinforcement learning policy that performs global reasoning over a probabilistic roadmap, using uncertainty estimates to plan informative and energy-efficient trajectories. This graph-based reasoning enables intelligent, non-myopic trajectory planning, guiding agents toward the most informative regions while satisfying safety constraints. Experimental results show that URAM improves reconstruction accuracy by up to 34% over existing baselines.


Hyper Yoshimura: How a slight tweak on a classical folding pattern unleashes meta-stability for deployable robots

arXiv.org Artificial Intelligence

Deployable structures inspired by origami have provided lightweight, compact, and reconfigurable solutions for various robotic and architectural applications. However, creating an integrated structural system that can effectively balance the competing requirements of high packing efficiency, simple deployment, and precise morphing into multiple load-bearing configurations remains a significant challenge. This study introduces a new class of hyper-Yoshimura origami, which exhibits a wide range of kinematically admissible and locally metastable states, including newly discovered symmetric "self-packing" and asymmetric "pop-out" states. This metastability is achieved by breaking a design rule of Yoshimura origami that has been in place for many decades. To this end, this study derives a new set of mathematically rigorous design rules and geometric formulations. Based on this, forward and inverse kinematic strategies are developed to stack hyper-Yoshimura modules into deployable booms that can approximate complex 3D shapes. Finally, this study showcases the potential of hyper-Yoshimura with a meter-scale pop-up cellphone charging station deployed at our university's bus transit station, along with a 3D-printed, scaled prototype of a space crane that can function as an object manipulator, solar tracking device, or high-load-bearing structure. These results establish hyper-Yoshimura as a promising platform for deployable and adaptable robotic systems in both terrestrial and space environments.


Russia accuses Ukraine of attacking nuclear plant, causing a fire

Al Jazeera

Russia has accused Ukraine of carrying out a drone attack on a nuclear plant that has caused a fire and damage to an auxiliary transformer as Ukraine celebrates its Independence Day for the 34th time. Sunday's attack forced a 50 percent reduction in the operating capacity at reactor number three at the Kursk Nuclear Power Plant (NPP), close to the border with Ukraine, according to Russian officials, who added that several power and energy facilities were targeted in the overnight strikes. The fire at the nuclear facility was quickly extinguished with no injuries reported, the plant's news service said on Telegram. Two other reactors are operating without power generation, and one is undergoing scheduled repairs, it said, adding that radiation levels were normal. Alexander Khinshtein, the Kursk region's acting governor, said Ukrainian attacks on the plant, 60km (38 miles) from the Russia-Ukraine border, "are a threat to nuclear safety and a violation of all international conventions".


What To Know About Google's AI Climate Footprint

TIME - Tech

For the climate concerned, the rise of the AI-reliant internet query is a cause for alarm. Many people have turned to ChatGPT and other services for simple questions. And even basic Google searches include an AI-derived result. Depending on how you crunch the numbers, it's possible to come up with a wide range for the energy usage and related climate cost of an AI query. ChatGPT provides the estimate of up to 0.34 watt-hours per prompt, equivalent to using a household lightbulb for 20 seconds, while one set of researchers concluded that some models may use as much as 100 times more for longer prompts.


The Download: Google's AI energy expenditure, and handing over DNA data to the police

MIT Technology Review

Google has just released a report detailing how much energy its Gemini apps use for each query. In total, the median prompt--one that falls in the middle of the range of energy demand--consumes 0.24 watt-hours of electricity, the equivalent of running a standard microwave for about one second. The company also provided average estimates for the water consumption (five drops per query) and carbon emissions associated with a text prompt to Gemini. It's the most transparent estimate yet from a Big Tech company with a popular AI product, and the report includes detailed information about how the company calculated its final estimate. Earlier this year, MIT Technology Review published a comprehensive series on AI and energy, at which time none of the major AI companies would reveal their per-prompt energy usage.






A Proof of Theorem 1 Proof. null null null null null null loss

Neural Information Processing Systems

We consider four types of benchmarks in our experiments, i.e., random COPs, scale-free networks, Therefore, to be fair and practical, we do not consider existing DNN-based BP variants. We compare our DABP with the following state-of-the-art COP solvers: (1) DBP with a damping factor of 0.9 and its splitting constraint factor graph version (DBP-SCFG) with a splitting ratio of 0.95 [ However, it can be extremely tedious and time-consuming to tune the damping factor. Figure 9: Convergence rates under different iteration limits ( | X | = 100) 4 size (i.e., 5) and the constraint functions are highly structured, which allows effective pruning and It also can be concluded that our DABP converges much faster than DBP and DBP-SCFG. To demonstrate the necessity of heterogeneous hyperparameters of Eq. (6), we conduct extensive Figure 1-12 present the results on solution quality. Table 1 presents the GPU memory footprint of our DABP .