Self-compacting concrete (SCC) became a strong candidate for various construction applications owing to its excellent workability, low labor demand, and enhanced finish-ability, because it provides solution the problem of mechanical vibration related noise pollution in urban settings. However, production Portland cement (PC) as primary constituent SCC is energy-intensive, contributing about 7% ...

In heuristic search planning, state-space symmetries are mostly ignored by both the search algorithm and the heuristic guidance. Only recently, Pochter, Zohar, and Rosenschein (2011) introduced an effective framework for detecting and accounting for state symmetries within A∗ cost-optimal planning. We extend this framework in order to allow usage of strictly larger symmetry groups. This enables...

Heuristic (Informed) Search takes advantage of problemspecific knowledge beyond the definition of the problem itself to find solutions more efficiently than uninformed search, such as Breadth-First Search (BFS) and Depth-First Search (DFS). We design domain-dependent search algorithms to plan tasks. However, the domain-dependent design pattern cannot be applied to fully automatic domains, such ...

Introduction: In order to promote the comprehensive utilization of iron and steel solid waste, slag (SS), granulated blast furnace (GBFS), flue gas desulfurization gypsum (FGDG) were used as raw materials replace cement prepare full waste premixed solidified agent (PSA). Then PSA, ore tailings (IOTs), water mixed building foundation pit backfilling (BFPBM). Methods: Various tests conducted inve...

This paper studied the influence of modulus and dosage sodium silicate on hydration alkali-activated copper-nickel slag (CNS) materials. CNS was used as main raw material, ground granulated blast furnace (GBFS) powder selected mineral additive. The hardening mechanisms were discussed. experimental results showed that [SiO4]4− [AlO4]5− with a high degree polymerization in glassy phase more easil...

Time-Bounded A* (TBA*) is a single-agent deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Although the idea underlying TBA* can be generalized to other single-agent deterministic search algorithms, little is known about the impact on performance that would result from using algorithms other th...