Block Placement Sequencing for Shorter Robot Travel Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current systems for block placement during construction, such as automated brick laying and computer-aided design software, face challenges in optimizing the sequence and layout of blocks to minimize travel distance and material usage while adhering to dependency rules and ensuring structural integrity.
Innovation Solution
A method and system for designing block sequences that involve acquiring block layout data, identifying sequence rules, generating multiple candidate block sequences based on path segment modifications, and selecting the optimal sequence to minimize distance traveled by the block laying robot, using rules like closest neighbor and dependency rules to override path segment lengths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If blocks are placed using traditional course-by-course method, then structural integrity is maintained, but total travel distance increases
Solution Approach 1:
The patent applies dynamics by transitioning from a static course-by-course placement method to a dynamic sequence that adapts block placement order based on real-time robot position and block dependencies. The system generates multiple candidate sequences and selects the optimal one that minimizes travel distance while maintaining structural requirements, allowing the placement strategy to evolve during construction.
Solution Approach 2:
The system changes the parameter of block placement sequence from fixed course-by-course order to optimized sequences generated through algorithmic evaluation. By calculating travel distances for different block ordering scenarios and selecting sequences that minimize total movement while respecting dependency constraints, the system optimizes the placement parameters without compromising structural integrity.
2Productivity
If multiple block sequences are generated and evaluated, then optimal placement sequence is found, but computational complexity increases
Solution Approach 1:
The patent segments the block placement problem into manageable components: identifying block dependencies, calculating travel distances between blocks, generating candidate sequences, and evaluating sequences against optimization criteria. This segmentation allows the complex optimization problem to be solved through systematic breakdown into discrete analytical steps.
Solution Approach 2:
The system generates multiple candidate block sequences (excessive action) to ensure optimal placement is found, then evaluates and selects the best sequence. By creating more candidate sequences than strictly necessary and using evaluation criteria to filter them, the system ensures optimal results while managing computational resources through systematic elimination of suboptimal sequences.
Data Source
AI summary
A method for designing a block sequence for use in ordering blocks for placement during construction, the method including, in one or more electronic processing devices acquiring block layout data indicative of block layouts for a number of block courses, identifying one or more sequence rules, generating different block sequences, each block sequence specifying an order in which blocks should be placed and being generated at least in part based on the sequence rules and selecting one of the different block sequences.